{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:03:16Z","timestamp":1757700196917},"reference-count":23,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2009,10,1]]},"DOI":"10.1215\/00294527-2009-019","type":"journal-article","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:11Z","timestamp":1265899151000},"source":"Crossref","is-referenced-by-count":5,"title":["Ramsey's Theorem for Pairs and Provably Recursive Functions"],"prefix":"10.1215","volume":"50","author":[{"given":"Ulrich","family":"Kohlenbach","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Kreuzer","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Bellin, G., \"Ramsey interpreted: A parametric version of Ramsey's theorem\", pp. 17--37 in <i>Logic and Computation (Pittsburgh, 1987)<\/i>, vol. 106 of <i>Contemporary Mathematics<\/i>, American Mathematical Society, Providence, 1990.","DOI":"10.1090\/conm\/106\/1057813"},{"key":"4","unstructured":"[4] Erd\u0151s, P., A. Hajnal, A. M\u00e1t\u00e9, and R. Rado, <i>Combinatorial Set Theory: Partition Relations for Cardinals<\/i>, vol. 106 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland Publishing Co., Amsterdam, 1984."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] G\u00f6del, K., \"\u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes\", <i>Dialectica<\/i>, vol. 12 (1958), pp. 280--87.","DOI":"10.1111\/j.1746-8361.1958.tb01464.x"},{"key":"6","unstructured":"[6] Graham, R. L., B. L. Rothschild, and J. H. Spencer, <i>Ramsey Theory<\/i>, 2d edition, Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley &amp; Sons Inc., New York, 1990."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Hirschfeldt, D. R., C. G. Jockusch, Jr., B. Kjos-Hanssen, S. Lempp, and T. A. Slaman, \"The strength of some combinatorial principles related to Ramsey's theorem for pairs\", pp. 143--62 in <i>Computational Prospects of Infinity, Part II<\/i>: Presented Talks, edited by C. Chong, Q. Feng, T. A. Slaman, W. H. Woodin, and Y. Yang, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, World Scientific, 2008.","DOI":"10.1142\/9789812796554_0008"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] 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--206.","DOI":"10.2178\/jsl\/1174668391"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Jockusch, C. G., Jr., \"Ramsey's theorem and recursion theory\", <i>The Journal of Symbolic Logic<\/i>, vol. 37 (1972), pp. 268--80.","DOI":"10.2307\/2272972"},{"key":"11","unstructured":"[11] Kleene, S. C., <i>Introduction to Metamathematics<\/i>, D. Van Nostrand Co., Inc., New York, 1952."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] 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--71.","DOI":"10.1007\/s001530050055"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Kohlenbach, U., \"Arithmetizing proofs in analysis\", pp. 115--58 in <i>Logic Colloquium '96 (San Sebasti\u00e1n)<\/i>, vol. 12 of <i>Lecture Notes Logic<\/i>, Springer, Berlin, 1998.","DOI":"10.1007\/978-3-662-22110-5_5"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] Kohlenbach, U., \"Elimination of Skolem functions for monotone formulas in analysis\", <i>Archive for Mathematical Logic<\/i>, vol. 37 (1998), pp. 363--90.","DOI":"10.1007\/s001530050104"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Kohlenbach, U., \"On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness\", <i>Annals of Pure and Applied Logic<\/i>, vol. 95 (1998), pp. 257--85.","DOI":"10.1016\/S0168-0072(98)00018-9"},{"key":"17","unstructured":"[17] Kohlenbach, U., <i>Applied Proof Theory: Proof Interpretations and Their Use in Mathematics<\/i>, Springer Monographs in Mathematics. Springer Verlag, 2008."},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] Seetapun, D., and T. A. Slaman, \"On the strength of Ramsey's theorem\", <i>Notre Dame Journal of Formal Logic<\/i>, vol. 36 (1995), pp. 570--82. Special Issue: Models of Arithmetic.","DOI":"10.1305\/ndjfl\/1040136917"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] Specker, E., \"Ramsey's theorem does not hold in recursive set theory\", pp. 439--42 in <i>Logic Colloquium '69 (Proceedings of the Summer School and Colloquium, Manchester, 1969)<\/i>, North-Holland, Amsterdam, 1971.","DOI":"10.1016\/S0049-237X(08)71242-4"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] Troelstra, A. S., \"Note on the fan theorem\", <i>The Journal of Symbolic Logic<\/i>, vol. 39 (1974), pp. 584--96.","DOI":"10.2307\/2272902"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Simpson, S. G., <i>Subsystems of Second Order Arithmetic<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/978-3-642-59971-2"},{"key":"1","unstructured":"[1] Avigad, J., ``Notes on $\\Pi^1_1$-conservativity, $\\omega$-submodels, and collection schema,'' Technical report, Carnegie Mellon Department of Philosophy, 2002. http:% \/\/www.andrew.cmu.edu\/user\/avigad\/Papers\/omegasubmodels.pdf."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Cholak, P. A., C. G. Jockusch, 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--55.","DOI":"10.2307\/2694910"},{"key":"9","unstructured":"[9] Hirst, J. L., <i>Combinatorics in Subsystems of Second-order Arithmetic<\/i>, Ph.D. thesis, Pennsylvania State University, 1987. http:\/\/www.% mathsci.appstate.edu\/~jlh\/bib\/pdf\/jhthesis.pdf."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Kohlenbach, U., \"The computational strength of extensions of weak K\u00f6nig's Lemma\", Research Series RS-98-41, BRICS, Department of Computer Science, University of Aarhus, December 1998, 23 pp.","DOI":"10.7146\/brics.v5i41.19486"},{"key":"18","unstructured":"[18] Kreuzer, A., <i>Der Satz von Ramsey f\u00fcr Paare und beweisbar rekursive Funktionen<\/i>, Diploma Thesis, Technische Universit\u00e4t Darmstadt, 2009."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Ramsey, F. P., \"On a problem of formal logic\", <i>Proceedings of the London Mathematical Society<\/i>, vol. s2-30 (1930), pp. 264--86.","DOI":"10.1112\/plms\/s2-30.1.264"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2009-019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:21Z","timestamp":1706648241000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-50\/issue-4\/Ramseys-Theorem-for-Pairs-and-Provably-Recursive-Functions\/10.1215\/00294527-2009-019.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,1]]},"references-count":23,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2009,10,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2009-019","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2009,10,1]]}}}