Abstract
We show that a version of Ramsey’s theorem for trees for arbitrary exponents is equivalent to the subsystem \({{\sf ACA}^\prime_{0}}\) of reverse mathematics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chubb J., Hirst J., McNicholl T.: Reverse mathematics, computability, and partitions of trees. J. Symb. Logic 74(1), 201–215 (2009)
Dzhafarov, D., Hirst, J.: The polarized Ramsey’s theorem. Arch. Math. Logic. doi:10.1007/s00153-008-0108-0 (in press)
Mileti J.R.: The canonical Ramsey theorem and computability theory. Trans. Am. Math. Soc. 360(3), 1309–1340 (2008) (electronic)
Simpson S.G.: Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic. Springer, Berlin (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Anderson, B.A., Hirst, J.L. Partitions of trees and \({{\sf ACA}^\prime_{0}}\) . Arch. Math. Logic 48, 227–230 (2009). https://doi.org/10.1007/s00153-009-0122-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-009-0122-x