{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T14:09:43Z","timestamp":1778767783115,"version":"3.51.4"},"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":[[2015,1,1]]},"DOI":"10.1215\/00294527-2835101","type":"journal-article","created":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T13:17:01Z","timestamp":1427203021000},"source":"Crossref","is-referenced-by-count":6,"title":["Rudimentary Recursion, Gentle Functions and Provident Sets"],"prefix":"10.1215","volume":"56","author":[{"given":"A. R. D.","family":"Mathias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. J.","family":"Bowler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"11","unstructured":"[M5] Mathias, A. R. D., \u201cRudimentary recursion and provident sets,\u201d preprint, 2009, <a href=\"http:\/\/www.dpmms.cam.ac.uk\/~ardm\/rudrec41.pdf\">http:\/\/www.dpmms.cam.ac.uk\/~ardm\/rudrec41.pdf<\/a>."},{"key":"12","unstructured":"[M6] Mathias, A. R. D., \u201cProvident sets and rudimentary set forcing,\u201d preprint, 2009, <a href=\"http:\/\/www.dpmms.cam.ac.uk\/~ardm\/fifo31.pdf\">http:\/\/www.dpmms.cam.ac.uk\/~ardm\/fifo31.pdf<\/a>."},{"key":"21","unstructured":"[W] Weaver, N., \u201cAnalysis in $J_{2}$,\u201d preprint, <a href=\"arXiv:math.LO\/0509245\">arXiv:math.LO\/0509245<\/a>."},{"key":"1","doi-asserted-by":"crossref","unstructured":"[De] Devlin, K., <i>Constructibility<\/i>, Perspectives in Mathematical Logic, Springer, Berlin, 1984.","DOI":"10.1007\/978-3-662-21723-8"},{"key":"2","unstructured":"[Do] Dodd, A. J., <i>The Core Model<\/i>, vol. 61 of <i>London Mathematical Society Lecture Note Series, Cambridge University Press<\/i>, Cambridge, 1982."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[G] Gandy, R. O., \u201cSet-theoretic functions for elementary syntax,\u201d pp. 103\u2013126 in vol. 13, part II of <i>Proceedings of Symposia in Pure Mathematics<\/i>, edited by T. Jech, American Mathematical Society, Providence, 1974.","DOI":"10.1090\/pspum\/013.2\/0376348"},{"key":"4","unstructured":"[J1] Jensen, R. B., Stufen der konstruktiblen Hierarchie. Habilitationsschrift, Universit at Bonn, 1967."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[J2] Jensen, R. B., \u201cThe fine structure of the constructible hierarchy,\u201d with a section by Jack Silver, <i>Annals of Mathematical Logic<\/i>, vol. 4 (1972), pp. 229\u2013308. Erratum, <i>Annals of Mathematical Logic<\/i>, vol. 4 (1972), p. 443.","DOI":"10.1016\/0003-4843(72)90008-3"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[JK] Jensen, R. B., and C. Karp, \u201cPrimitive recursive set functions,\u201d pp. 143\u2013176 in vol. 13, part I of <i>Proceedings of Symposia in Pure Mathematics<\/i>, edited by D. Scott, American Mathematical Society, Providence, 1971.","DOI":"10.1090\/pspum\/013.1\/0281602"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[M1] Mathias, A. R. D., \u201cSlim models of Zermelo set theory,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 487\u2013496.","DOI":"10.2307\/2695026"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[M2] Mathias, A. R. D., \u201cThe strength of Mac Lane set theory,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 110 (2001), pp. 107\u2013234.","DOI":"10.1016\/S0168-0072(00)00031-2"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[M3] Mathias, A. R. D., \u201cWeak systems of Gandy, Jensen and Devlin,\u201d pp. 149\u2013224 in <i>Set Theory: Centre de Recerca Matem\u00e0tica, Barcelona 2003\u20134<\/i>, edited by Joan Bagaria and Stevo Todorcevic, Trends in Mathematics, Birkh\u00e4user, Basel, 2006.","DOI":"10.1007\/3-7643-7692-9_6"},{"key":"10","unstructured":"[M4] Mathias, A. R. D., \u201cSet forcing over models of Zermelo or Mac Lane,\u201d pp. 41\u201366 in <i>One Hundred Years of Axiomatic Set Theory<\/i>, edited by R. Hinnion and T. Libert, vol. 17 of <i>Cahiers du Centre de logique<\/i>, Academia-Bruylant, Louvain-la-Neuve, 2010."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[M7] Mathias, A. R. D., \u201cUnordered pairs in the set theory of Bourbaki 1949,\u201d <i>Archiv f\u00fcr Mathematik<\/i>, vol. 94 (2010), pp. 1\u201310.","DOI":"10.1007\/s00013-009-0006-7"},{"key":"14","unstructured":"[M8] Mathias, A. R. D., \u201cProvident sets and rudimentary set forcing,\u201d preprint, to appear in <i>Fundamenta Mathematic\u00e6<\/i>."},{"key":"15","unstructured":"[M9] Mathias, A. R. D., \u201cProvident set theory,\u201d in preparation."},{"key":"16","unstructured":"[S] Scott, D., personal correspondence on formal geometry and rudimentary functions, February\/March 2006."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[SMcC] Scott, D., and D. McCarty, \u201cReconsidering ordered pairs,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 14 (2008), 379\u201397.","DOI":"10.2178\/bsl\/1231081372"},{"key":"18","unstructured":"[Stan] Lee, S., Review of [De], <i>Journal of Symbolic Logic<\/i>, vol. 53 (1987), 864\u20138."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[Stav] Stavi, J., \u201cA converse of the Barwise completeness theorem,\u201d <i>Journal of Symbolic Logic<\/i> vol. 38 (1973), 594\u2013612.","DOI":"10.2307\/2271985"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[SZ] Schindler, R., and M. Zeman, \u201cFine structure,\u201d in <i>Handbook of Set Theory<\/i>, vol. 1, edited by M. Foreman and A. Kanamori, Springer, Dordrecht, 2010, 605\u2013656.","DOI":"10.1007\/978-1-4020-5764-9_10"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2835101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:58:26Z","timestamp":1706648306000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-56\/issue-1\/Rudimentary-Recursion-Gentle-Functions-and-Provident-Sets\/10.1215\/00294527-2835101.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2835101","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}