### Primitive Recursion and the Chain Antichain Principle

Alexander P. Kreuzer
Source: Notre Dame J. Formal Logic Volume 53, Number 2 (2012), 245-265.

#### Abstract

Let the chain antichain principle (CAC) be the statement that each partial order on $\mathbb{N}$ possesses an infinite chain or an infinite antichain. Chong, Slaman, and Yang recently proved using forcing over nonstandard models of arithmetic that CAC is $\Pi^1_1$-conservative over $\text{RCA}_0+\Pi^0_1\text{-CP}$ and so in particular that CAC does not imply $\Sigma^0_2$-induction. We provide here a different purely syntactical and constructive proof of the statement that CAC (even together with WKL) does not imply $\Sigma^0_2$-induction. In detail we show using a refinement of Howard's ordinal analysis of bar recursion that $\text{WKL}_0^\omega+\text{CAC}$ is $\Pi^0_2$-conservative over PRA and that one can extract primitive recursive realizers for such statements. Moreover, our proof is finitary in the sense of Hilbert's program. CAC implies that every sequence of $\mathbb{R}$ has a monotone subsequence. This Bolzano-Weierstraß}-like principle is commonly used in proofs. Our result makes it possible to extract primitive recursive terms from such proofs. We also discuss the Erdős-Moser principle, which—taken together with CAC—is equivalent to $\text{RT}^2_2$.

First Page:
Primary Subjects: 03F35, 03B30, 03F10
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1336588253
Digital Object Identifier: doi:10.1215/00294527-1715716
Mathematical Reviews number (MathSciNet): MR2925280
Zentralblatt MATH identifier: 06054428

### References

Avigad, J., "Notes on $\upPi^1_1$"-conservativity, $\omega$-submodels, and collection schema, Technical Report, Carnegie Mellon Department of Philosophy, available at www.andrew.cmu.edu/user/avigad/Papers/omegasubmodels.pdf, 2002.
Bezem, M., "Strongly majorizable functionals of finite type: A model for bar recursion containing discontinuous functionals", The Journal of Symbolic Logic, vol. 50 (1985), pp. 652–60.
Mathematical Reviews (MathSciNet): MR805674
Zentralblatt MATH: 0578.03030
Digital Object Identifier: doi:10.2307/2274319
Bovykin, A., and A. Weiermann, "The strength of infinitary Ramseyan principles can be accessed by their densities", forthcoming in Annals of Pure and Applied Logic, logic.pdmi.ras.ru/~ andrey/research.html, 2005.
Cholak, P. A., C. G. Jockusch, Jr., and T. A. Slaman, "On the strength of Ramsey's theorem for pairs", The Journal of Symbolic Logic, vol. 66 (2001), pp. 1–55.
Mathematical Reviews (MathSciNet): MR1825173
Zentralblatt MATH: 0977.03033
Digital Object Identifier: doi:10.2307/2694910
Chong, C., T. Slaman, and Y. Yang, "$\upPi^0_1$"-conservation of combinatorial principles weaker than Ramsey's theorem for pairs", forthcoming in Advances in Mathematics.
de Smet, M., and A. Weiermann, "Phase transitions for weakly increasing sequences", pp. 168–74 in Logic and Theory of Algorithms, vol. 5028 of Lecture Notes in Computer Science, Springer, Berlin, 2008.
Mathematical Reviews (MathSciNet): MR2507015
Zentralblatt MATH: 1143.03020
Digital Object Identifier: doi:10.1007/978-3-540-69407-6_20
de Smet, M., and A. Weiermann, "Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences"", Journal of Logic and Computation, (2010). logcom.oxfordjournals.org/content/early/2010/02/09/logcom.exq004.full.pdf+html.
Zentralblatt MATH: 1244.03121
Downey, R., "Computability theory and linear orderings", pp. 823–976 in Handbook of Recursive Mathematics, Vol. 2, vol. 139 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1998.
Mathematical Reviews (MathSciNet): MR1673590
Zentralblatt MATH: 0941.03045
Downey, R., D. R. Hirschfeldt, S. Lempp, and R. Solomon, "A $\upDelta^0_2$" set with no infinite low subset in either it or its complement, The Journal of Symbolic Logic, vol. 66 (2001), pp. 1371–81.
Mathematical Reviews (MathSciNet): MR1856748
Zentralblatt MATH: 0990.03046
Digital Object Identifier: doi:10.2307/2695113
Hájek, P., and P. Pudlák, Metamathematics of First-Order Arithmetic, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1998.
Mathematical Reviews (MathSciNet): MR1748522
Zentralblatt MATH: 0889.03053
Hirschfeldt, D. R., and R. A. Shore, "Combinatorial principles weaker than Ramsey's theorem for pairs", The Journal of Symbolic Logic, vol. 72 (2007), pp. 171–206.
Mathematical Reviews (MathSciNet): MR2298478
Zentralblatt MATH: 1118.03055
Digital Object Identifier: doi:10.2178/jsl/1174668391
Project Euclid: euclid.jsl/1174668391
Hirst, J. L., Combinatorics in Subsystems of Second Order Arithmetic, Ph.D. thesis, The Pennsylvania State University, University Park, 1987. www.mathsci.appstate.edu/~ jlh/bib/pdf/jhthesis.pdf.
Mathematical Reviews (MathSciNet): MR2635978
Howard, W. A., "Ordinal analysis of terms of finite type", The Journal of Symbolic Logic, vol. 45 (1980), pp. 493–504.
Mathematical Reviews (MathSciNet): MR583368
Zentralblatt MATH: 0444.03029
Digital Object Identifier: doi:10.2307/2273417
Howard, W. A., "Ordinal analysis of simple cases of bar recursion", The Journal of Symbolic Logic, vol. 46 (1981), pp. 17–30.
Mathematical Reviews (MathSciNet): MR604874
Zentralblatt MATH: 0463.03031
Digital Object Identifier: doi:10.2307/2273252
Kohlenbach, U., "Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization", The Journal of Symbolic Logic, vol. 57 (1992), pp. 1239–73.
Mathematical Reviews (MathSciNet): MR1195271
Zentralblatt MATH: 0781.03051
Digital Object Identifier: doi:10.2307/2275367
Kohlenbach, U., "Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals", Archive for Mathematical Logic, vol. 36 (1996), pp. 31–71.
Mathematical Reviews (MathSciNet): MR1462200
Zentralblatt MATH: 0882.03050
Digital Object Identifier: doi:10.1007/s001530050055
Kohlenbach, U., “Elimination of Skolem functions for monotone formulas in analysis,” Logic Colloquium '95 (Haifa), Archive for Mathematical Logic, vol. 37 (1998), pp. 363–90.
Mathematical Reviews (MathSciNet): MR1634279
Zentralblatt MATH: 0916.03040
Digital Object Identifier: doi:10.1007/s001530050104
Kohlenbach, U., "Higher order reverse mathematics", pp. 281–95 in Reverse Mathematics 2001, vol. 21 of Lecture Notes in Logic, Association for Symbolic Logic, La Jolla, 2005.
Mathematical Reviews (MathSciNet): MR2185441
Zentralblatt MATH: 1097.03053
Kohlenbach, U., Applied Proof Theory: Proof Interpretations and Their Use in Mathematics, Springer Monographs in Mathematics. Springer Verlag, Berlin, 2008.
Mathematical Reviews (MathSciNet): MR2445721
Zentralblatt MATH: 1158.03002
Kreuzer, A. P., "The cohesive principle and the Bolzano-Weierstraß principle", Mathematical Logic Quarterly, vol. 57 (2011), pp. 292–98.
Mathematical Reviews (MathSciNet): MR2839129
Zentralblatt MATH: 05909702
Digital Object Identifier: doi:10.1002/malq.201010008
Kreuzer, A. P., and U. Kohlenbach, “Term extraction and Ramsey's theorem for pairs,” forthcoming in The Journal of Symbolic Logic.
Luckhardt, H., Extensional Gödel Functional Interpretation. A Consistency Proof of Classical Analysis, vol. 306 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1973.
Mathematical Reviews (MathSciNet): MR0337512
Zentralblatt MATH: 0262.02031
Parsons, C., "On a number theoretic choice schema and its relation to induction", pp. 459–73 in Intuitionism and Proof Theory (Proceedings of the Conference, Buffalo, 1968), edited by A. Kino, J. Myhill, and R. E. Vesley, North-Holland, Amsterdam, 1970.
Mathematical Reviews (MathSciNet): MR0280330
Zentralblatt MATH: 0202.01202
Digital Object Identifier: doi:10.1016/S0049-237X(08)70771-7
Simpson, S. G., Subsystems of Second Order Arithmetic, 2nd edition, Perspectives in Logic. Cambridge University Press, Cambridge, 2009.
Mathematical Reviews (MathSciNet): MR2517689
Zentralblatt MATH: 1205.03002