{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:31Z","timestamp":1706649031839},"reference-count":12,"publisher":"Duke University Press","issue":"4","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-1722710","type":"journal-article","created":{"date-parts":[[2012,11,8]],"date-time":"2012-11-08T14:20:17Z","timestamp":1352384417000},"source":"Crossref","is-referenced-by-count":4,"title":["Degrees of Relative Provability"],"prefix":"10.1215","volume":"53","author":[{"given":"Mingzhong","family":"Cai","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Axt, P., \u201cOn a subrecursive hierarchy and primitive recursive degrees,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 92 (1959), pp. 85\u2013105.","DOI":"10.1090\/S0002-9947-1959-0126377-3"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Buss, S., \u201cAn Introduction to Proof Theory,\u201d pp. 1\u201378 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)80016-5"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Dehornoy, P., \u201cElementary embeddings and algebra,\u201d pp. 737\u201374 in <i>Handbook of Set Theory<\/i>, edited by M. Foreman and A. Kanamori, Dordrecht, Springer, 2010.","DOI":"10.1007\/978-1-4020-5764-9_12"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] 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":"5","doi-asserted-by":"publisher","unstructured":"[5] Kirby, L., and J. Paris, \u201cAccessible independence results for Peano arithmetic,\u201d <i>Bulletin of the London Mathematical Society<\/i>, vol. 14 (1982), pp. 285\u201393.","DOI":"10.1112\/blms\/14.4.285"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Kleene, S. C., \u201cExtension of an effectively generated class of functions by enumeration,\u201d <i>Colloquium Mathematicum<\/i>, vol. 6 (1958), pp. 67\u201378.","DOI":"10.4064\/cm-6-1-67-78"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Kristiansen, L., \u201cA jump operator on honest subrecursive degrees,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 37 (1997), pp. 105\u201325.","DOI":"10.1007\/s001530050086"},{"key":"8","unstructured":"[8] Kristiansen, L., \u201cLow<sub><i>n<\/i><\/sub>, High<sub><i>n<\/i><\/sub>, and intermediate subrecursive degrees,\u201d pp. 286\u2013300 in <i>Combinatorics, Computation, and Logic (Aukland, 1999)<\/i>, edited by C. S. Calude and M. S. Dinneen, vol. 21 of <i>Australian Computer Science Communications<\/i>, Springer, Singapore, 1999."},{"key":"9","unstructured":"[9] Kristiansen, L., J. Schlage-Puchta, and A. Weiermann, \u201cStreamlined subrecursive degree theory,\u201d preprint."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Paris, J., and L. Harrington, \u201cA mathematical incompleteness in Peano arithmetic,\u201d pp. 1133\u201342 in <i>Handbook of Mathematical Logic<\/i>, edited by J. Barwise, vol. 90 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1977.","DOI":"10.1016\/S0049-237X(08)71130-3"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Pohlers, W., \u201cSubsystems of set theory and second order number theory,\u201d pp. 209\u2013335 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)80019-0"},{"key":"12","unstructured":"[12] Rogers, H., <i>Theory of Recursive Functions and Effective Computability<\/i>, 2nd edition, MIT Press, Cambridge, Mass., 1987."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1722710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:56Z","timestamp":1706648276000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-53\/issue-4\/Degrees-of-Relative-Provability\/10.1215\/00294527-1722710.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":12,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2012,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1722710","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}