On the role of the collection principle for $\Sigma ^0_2$-formulas in second-order reverse mathematics
HTML articles powered by AMS MathViewer
- by C. T. Chong, Steffen Lempp and Yue Yang PDF
- Proc. Amer. Math. Soc. 138 (2010), 1093-1100 Request permission
Abstract:
We show that the principle $\mathsf {PART}$ from Hirschfeldt and Shore is equivalent to the $\Sigma ^0_2$-Bounding principle $B\Sigma ^0_2$ over $\mathsf {RCA}_0$, answering one of their open questions.
Furthermore, we also fill a gap in a proof of Cholak, Jockusch and Slaman by showing that $D^2_2$ implies $B\Sigma ^0_2$ and is thus indeed equivalent to Stable Ramsey’s Theorem for Pairs ($\mathsf {SRT}^2_2$). This also allows us to conclude that the combinatorial principles $\mathsf {IPT}^2_2$, $\mathsf {SPT}^2_2$ and $\mathsf {SIPT}^2_2$ defined by Dzhafarov and Hirst all imply $B\Sigma ^0_2$ and thus that $\mathsf {SPT}^2_2$ and $\mathsf {SIPT}^2_2$ are both equivalent to $\mathsf {SRT}^2_2$ as well.
Our proof uses the notion of a bi-tame cut, the existence of which we show to be equivalent, over $\mathsf {RCA}_0$, to the failure of $B\Sigma ^0_2$.
References
- Peter A. Cholak, Carl G. Jockusch, and Theodore A. Slaman, On the strength of Ramsey’s theorem for pairs, J. Symbolic Logic 66 (2001), no. 1, 1–55. MR 1825173, DOI 10.2307/2694910
- C. T. Chong, An $\alpha$-finite injury method of the unbounded type, J. Symbolic Logic 41 (1976), no. 1, 1–17. MR 476456, DOI 10.2307/2272939
- C. T. Chong and Yue Yang, $\Sigma _2$ induction and infinite injury priority arguments. II. Tame $\Sigma _2$ coding and the jump operator, Ann. Pure Appl. Logic 87 (1997), no. 2, 103–116. Logic Colloquium ’95 Haifa. MR 1490049, DOI 10.1016/0168-0072(96)00028-0
- P. Erdös and R. Rado, A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956), 427–489. MR 81864, DOI 10.1090/S0002-9904-1956-10036-0
- Damir D. Dzhafarov and Jeffry L. Hirst, The polarized Ramsey’s theorem, Arch. Math. Logic 48 (2009), no. 2, 141–157. MR 2487221, DOI 10.1007/s00153-008-0108-0
- Petr Hájek and Pavel Pudlák, Metamathematics of first-order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1998. Second printing. MR 1748522
- Denis R. Hirschfeldt and Richard A. Shore, Combinatorial principles weaker than Ramsey’s theorem for pairs, J. Symbolic Logic 72 (2007), no. 1, 171–206. MR 2298478, DOI 10.2178/jsl/1174668391
- Hirst, Jeffry L., Combinatorics in subsystems of second order arithmetic, Ph.D. Dissertation, Pennsylvania State University, 1987.
- Manuel Lerman, On suborderings of the $\alpha$-recursively enumerable $\alpha$-degrees, Ann. Math. Logic 4 (1972), 369–392. MR 327493, DOI 10.1016/0003-4843(72)90005-8
- Stephen G. Simpson, Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999. MR 1723993, DOI 10.1007/978-3-642-59971-2
- Theodore A. Slaman, $\Sigma _n$-bounding and $\Delta _n$-induction, Proc. Amer. Math. Soc. 132 (2004), no. 8, 2449–2456. MR 2052424, DOI 10.1090/S0002-9939-04-07294-6
Additional Information
- C. T. Chong
- Affiliation: Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Singapore
- MR Author ID: 48725
- Email: chongct@math.nus.edu.sg
- Steffen Lempp
- Affiliation: Department of Mathematics, University of Wisconsin, 480 Lincoln Drive, Madison, Wisconsin 53706-1388
- MR Author ID: 247988
- Email: lempp@math.wisc.edu
- Yue Yang
- Affiliation: Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Singapore
- Email: matyangy@math.nus.edu.sg
- Received by editor(s): June 10, 2009
- Received by editor(s) in revised form: June 23, 2009, and July 9, 2009
- Published electronically: October 26, 2009
- Additional Notes: The main ideas were conceived during the workshop on “Computability, Reverse Mathematics and Combinatorics” at Banff International Research Station in December 2008. The authors wish to thank Banff International Research Station for its hospitality; Richard Shore for useful discussions and for pointing out an error in an earlier version; and Carl Jockusch, Richard Shore, Jeff Hirst and Damir Dzhafarov for mentioning related problems which could be solved by our main result. The research of the first author was supported in part by NUS grant WBS C146-000-025-001. The second author’s research was partially supported by NSF grant DMS–0555381 as well as grant no. 13407 by the John Templeton Foundation entitled “Exploring the Infinite by Finitary Means”. The third author was partially supported by NUS Academic Research grant R 146-000-114-112.
- Communicated by: Julia Knight
- © Copyright 2009
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Proc. Amer. Math. Soc. 138 (2010), 1093-1100
- MSC (2000): Primary 03F35; Secondary 03H15
- DOI: https://doi.org/10.1090/S0002-9939-09-10115-6
- MathSciNet review: 2566574