{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:17:57Z","timestamp":1706660277560},"reference-count":21,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1215\/00294527-2019-0031","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T03:00:29Z","timestamp":1574996429000},"source":"Crossref","is-referenced-by-count":2,"title":["Short Proofs for Slow Consistency"],"prefix":"10.1215","volume":"61","author":[{"given":"Anton","family":"Freund","sequence":"first","affiliation":[]},{"given":"Fedor","family":"Pakhomov","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"5","unstructured":"[5] Carnielli, W. A., and M. Rathjen, \u201cHydrae and subsystems of arithmetic,\u201d Universit\u00e4t M\u00fcnster, 1991. <a href=\"http:\/\/www1.maths.leeds.ac.uk\/~rathjen\/HydraeSubArith.pdf\">http:\/\/www1.maths.leeds.ac.uk\/~rathjen\/HydraeSubArith.pdf<\/a> (accessed 7 December 2015)."},{"key":"12","unstructured":"[12] Freund, A., \u201cA uniform characterization of $\\Sigma _{1}$-reflection over the fragments of Peano arithmetic,\u201d preprint, <a href=\"arXiv:1512.05122v1\">arXiv:1512.05122v1<\/a> [math.LO]."},{"key":"15","unstructured":"[15] Henk, P., and F. Pakhomov, \u201cSlow and ordinary provability for Peano arithmetic,\u201d preprint, <a href=\"arXiv:1602.01822v2\">arXiv:1602.01822v2<\/a> [math.LO]."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Feferman, S., \u201cReflecting on incompleteness,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 56 (1991), pp. 1\u201349.","DOI":"10.2307\/2274902"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Feferman, S., \u201cArithmetization of metamathematics in a general setting,\u201d <i>Fundamenta Mathematicae<\/i>, vol. 49 (1960\/1961), pp. 35\u201392.","DOI":"10.4064\/fm-49-1-35-92"},{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Beklemishev, L. D., \u201cProof-theoretic analysis by iterated reflection,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 42 (2003), pp. 515\u201352.","DOI":"10.1007\/s00153-002-0158-7"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Buchholz, W., \u201cNotation systems for infinitary derivations,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 30 (1991), pp. 277\u201396.","DOI":"10.1007\/BF01621472"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Buchholz, W., and S. Wainer, \u201cProvably computable functions and the fast growing hierarchy,\u201d pp. 179\u201398 in <i>Logic and Combinatorics (Arcata, 1985)<\/i>, edited by S. G. Simpson, vol. 65 of <i>Contemporary Mathematics<\/i>, Amer. Math. Soc., Providence, 1987.","DOI":"10.1090\/conm\/065\/891248"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Buss, S. R., \u201cAn introduction to proof theory,\u201d pp. 1\u201378 in <i>Handbook of Proof Theory<\/i>, vol. 137 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80016-5"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Fairtlough, M., and S. S. Wainer, \u201cHierarchies of provably recursive functions,\u201d pp. 149\u2013207 in <i>Handbook of Proof Theory<\/i>, edited by S. R. Buss, vol. 137 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80018-9"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Ferrante, J., and C. W. Rackoff, <i>The Computational Complexity of Logical Theories<\/i>, vol. 718 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1979.","DOI":"10.1007\/BFb0062837"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Freund, A., \u201cProof lengths for instances of the Paris-Harrington principle,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 168 (2017), pp. 1361\u201382.","DOI":"10.1016\/j.apal.2017.01.004"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Freund, A., \u201cSlow reflection,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 168 (2017), pp. 2103\u201328.","DOI":"10.1016\/j.apal.2017.06.003"},{"key":"13","unstructured":"[13] Friedman, H., \u201cOn the consistency, completeness, and correctness problems,\u201d preprint, Ohio State University, 1979."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Friedman, S.-D., M. Rathjen, and A. Weiermann, \u201cSlow consistency,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 164 (2013), pp. 382\u201393.","DOI":"10.1016\/j.apal.2012.11.009"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Ketonen, J., and R. Solovay, \u201cRapidly growing Ramsey functions,\u201d <i>Annals of Mathematics (2)<\/i>, vol. 113 (1981), pp. 267\u2013314.","DOI":"10.2307\/2006985"},{"key":"17","unstructured":"[17] Paris, J. B., \u201cA hierarchy of cuts in models of arithmetic,\u201d pp. 312\u201337 in <i>Model Theory of Algebra and Arithmetic (Karpacz, 1979)<\/i>, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, vol. 834 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1980."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Pudl\u00e1k, P., \u201cOn the length of proofs of finitistic consistency statements in first order theories,\u201d pp. 165\u201396 in <i>Logic Colloquium \u201984 (Manchester, 1984)<\/i>, edited by J. B. Paris, A. J. Wilkie, and G. M. Wilmers, vol. 120 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1986.","DOI":"10.1016\/S0049-237X(08)70462-2"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Pudl\u00e1k, P., \u201cThe lengths of proofs,\u201d pp. 547\u2013637 in <i>Handbook of Proof Theory<\/i>, edited by S. R. Buss, vol. 137 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80023-2"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] Pudl\u00e1k, P., \u201cIncompleteness in the finite domain,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 23 (2017), pp. 405\u201341.","DOI":"10.1017\/bsl.2017.32"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Sommer, R., \u201cTransfinite induction within Peano arithmetic,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 76 (1995), pp. 231\u201389.","DOI":"10.1016\/0168-0072(95)00029-G"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2019-0031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:59Z","timestamp":1706648399000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-61\/issue-1\/Short-Proofs-for-Slow-Consistency\/10.1215\/00294527-2019-0031.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2019-0031","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}