{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T21:52:38Z","timestamp":1723672358004},"reference-count":5,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2019,8,1]]},"DOI":"10.1215\/00294527-2019-0013","type":"journal-article","created":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T02:01:01Z","timestamp":1562205661000},"source":"Crossref","is-referenced-by-count":1,"title":["A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic"],"prefix":"10.1215","volume":"60","author":[{"given":"Mohammad","family":"Ardeshir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erfan","family":"Khaniki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Shahriari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Ardeshir, M. and B. Hesaam, \u201cAn introduction to basic arithmetic,\u201d <i>Logic Journal of the IGPL<\/i>, vol. 16 (2008), pp. 1\u201313.","DOI":"10.1093\/jigpal\/jzm013"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Ruitenburg, W., \u201cBasic predicate calculus,\u201d <i>Notre Dame Journal of Formal Logic<\/i>, vol. 39 (1998), pp. 18\u201346.","DOI":"10.1305\/ndjfl\/1039293019"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Salehi, S., \u201cProvably total functions of Basic Arithmetic,\u201d <i>Mathematical Logic Quarterly (MLQ)<\/i>, vol. 49 (2003), pp. 316\u201322.","DOI":"10.1002\/malq.200310032"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Salehi, S., \u201cPolynomially bounded recursive realizability,\u201d <i>Notre Dame Journal of Formal Logic<\/i>, vol. 46 (2005), pp. 407\u201317.","DOI":"10.1305\/ndjfl\/1134397659"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Zagier, D., \u201cNewman\u2019s short proof of the prime number theorem,\u201d <i>American Mathematical Monthly<\/i>, vol. 104 (1997), pp. 705\u201308.","DOI":"10.1080\/00029890.1997.11990704"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2019-0013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:50Z","timestamp":1706648390000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-60\/issue-3\/A-Counterexample-to-Polynomially-Bounded-Realizability-of-Basic-Arithmetic\/10.1215\/00294527-2019-0013.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":5,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,8,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2019-0013","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8,1]]}}}