{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:34:46Z","timestamp":1772357686849,"version":"3.50.1"},"reference-count":24,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2012,1,1]]},"DOI":"10.1215\/00294527-1715716","type":"journal-article","created":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T18:31:09Z","timestamp":1336588269000},"source":"Crossref","is-referenced-by-count":15,"title":["Primitive Recursion and the Chain Antichain Principle"],"prefix":"10.1215","volume":"53","author":[{"given":"Alexander P.","family":"Kreuzer","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","unstructured":"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."},{"key":"2","doi-asserted-by":"publisher","unstructured":"Bezem, M., \"Strongly majorizable functionals of finite type: A model for bar recursion containing discontinuous functionals\", <i>The Journal of Symbolic Logic<\/i>, vol. 50 (1985), pp. 652\u201360.","DOI":"10.2307\/2274319"},{"key":"3","unstructured":"Bovykin, A., and A. Weiermann, \"The strength of infinitary Ramseyan principles can be accessed by their densities\", forthcoming in <i>Annals of Pure and Applied Logic<\/i>, logic.pdmi.ras.ru\/~ andrey\/research.html, 2005."},{"key":"4","doi-asserted-by":"publisher","unstructured":"Cholak, P. A., C. G. Jockusch, Jr., and T. A. Slaman, \"On the strength of Ramsey's theorem for pairs\", <i>The Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 1\u201355.","DOI":"10.2307\/2694910"},{"key":"5","unstructured":"Chong, C., T. Slaman, and Y. Yang, \"$\\upPi^0_1$\"-conservation of combinatorial principles weaker than Ramsey's theorem for pairs\", forthcoming in <i>Advances in Mathematics<\/i>."},{"key":"6","doi-asserted-by":"publisher","unstructured":"de Smet, M., and A. Weiermann, \"Phase transitions for weakly increasing sequences\", pp. 168\u201374 in <i>Logic and Theory of Algorithms<\/i>, vol. 5028 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2008.","DOI":"10.1007\/978-3-540-69407-6_20"},{"key":"7","unstructured":"de Smet, M., and A. Weiermann, \"Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences\"\", <i>Journal of Logic and Computation<\/i>, (2010). logcom.oxfordjournals.org\/content\/early\/2010\/02\/09\/logcom.exq004.full.pdf+html."},{"key":"8","doi-asserted-by":"crossref","unstructured":"Downey, R., \"Computability theory and linear orderings\", pp. 823\u2013976 in <i>Handbook of Recursive Mathematics, Vol. 2<\/i>, vol. 139 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80047-5"},{"key":"9","doi-asserted-by":"publisher","unstructured":"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, <i>The Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 1371\u201381.","DOI":"10.2307\/2695113"},{"key":"10","unstructured":"H\u00e1jek, P., and P. Pudl\u00e1k, <i>Metamathematics of First-Order Arithmetic<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1998."},{"key":"11","doi-asserted-by":"publisher","unstructured":"Hirschfeldt, D. R., and R. A. Shore, \"Combinatorial principles weaker than Ramsey's theorem for pairs\", <i>The Journal of Symbolic Logic<\/i>, vol. 72 (2007), pp. 171\u2013206.","DOI":"10.2178\/jsl\/1174668391"},{"key":"12","unstructured":"Hirst, J. L., <i>Combinatorics in Subsystems of Second Order Arithmetic<\/i>, Ph.D. thesis, The Pennsylvania State University, University Park, 1987. www.mathsci.appstate.edu\/~ jlh\/bib\/pdf\/jhthesis.pdf."},{"key":"13","doi-asserted-by":"publisher","unstructured":"Howard, W. A., \"Ordinal analysis of terms of finite type\", <i>The Journal of Symbolic Logic<\/i>, vol. 45 (1980), pp. 493\u2013504.","DOI":"10.2307\/2273417"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Howard, W. A., \"Ordinal analysis of simple cases of bar recursion\", <i>The Journal of Symbolic Logic<\/i>, vol. 46 (1981), pp. 17\u201330.","DOI":"10.2307\/2273252"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Kohlenbach, U., \"Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization\", <i>The Journal of Symbolic Logic<\/i>, vol. 57 (1992), pp. 1239\u201373.","DOI":"10.2307\/2275367"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Kohlenbach, U., \"Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals\", <i>Archive for Mathematical Logic<\/i>, vol. 36 (1996), pp. 31\u201371.","DOI":"10.1007\/s001530050055"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Kohlenbach, U., \u201cElimination of Skolem functions for monotone formulas in analysis,\u201d Logic Colloquium '95 (Haifa), <i>Archive for Mathematical Logic<\/i>, vol. 37 (1998), pp. 363\u201390.","DOI":"10.1007\/s001530050104"},{"key":"18","doi-asserted-by":"crossref","unstructured":"Kohlenbach, U., \"Higher order reverse mathematics\", pp. 281\u201395 in <i>Reverse Mathematics 2001<\/i>, vol. 21 of <i>Lecture Notes in Logic<\/i>, Association for Symbolic Logic, La Jolla, 2005.","DOI":"10.1017\/9781316755846.018"},{"key":"19","unstructured":"Kohlenbach, U., <i>Applied Proof Theory: Proof Interpretations and Their Use in Mathematics<\/i>, Springer Monographs in Mathematics. Springer Verlag, Berlin, 2008."},{"key":"20","doi-asserted-by":"publisher","unstructured":"Kreuzer, A. P., \"The cohesive principle and the Bolzano-Weierstra\u00df principle\", <i>Mathematical Logic Quarterly<\/i>, vol. 57 (2011), pp. 292\u201398.","DOI":"10.1002\/malq.201010008"},{"key":"21","unstructured":"Kreuzer, A. P., and U. Kohlenbach, \u201cTerm extraction and Ramsey's theorem for pairs,\u201d forthcoming in <i>The Journal of Symbolic Logic<\/i>."},{"key":"22","doi-asserted-by":"crossref","unstructured":"Luckhardt, H., <i>Extensional G\u00f6del Functional Interpretation. A Consistency Proof of Classical Analysis<\/i>, vol. 306 of <i>Lecture Notes in Mathematics<\/i>, Springer-Verlag, Berlin, 1973.","DOI":"10.1007\/BFb0060871"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Parsons, C., \"On a number theoretic choice schema and its relation to induction\", pp. 459\u201373 in <i>Intuitionism and Proof Theory (Proceedings of the Conference, Buffalo, 1968)<\/i>, edited by A. Kino, J. Myhill, and R. E. Vesley, North-Holland, Amsterdam, 1970.","DOI":"10.1016\/S0049-237X(08)70771-7"},{"key":"24","doi-asserted-by":"crossref","unstructured":"Simpson, S. G., <i>Subsystems of Second Order Arithmetic<\/i>, 2nd edition, Perspectives in Logic. Cambridge University Press, Cambridge, 2009.","DOI":"10.1017\/CBO9780511581007"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1715716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:51Z","timestamp":1706648271000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-53\/issue-2\/Primitive-Recursion-and-the-Chain-Antichain-Principle\/10.1215\/00294527-1715716.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2012,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1715716","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}