{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:08:54Z","timestamp":1648750134106},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0304-3975(00)00116-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"185-239","source":"Crossref","is-referenced-by-count":1,"title":["The prime number theorem is PRA-provable"],"prefix":"10.1016","volume":"257","author":[{"given":"Olivier","family":"Sudac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00116-X_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1145\/321450.321460","article-title":"Analysis in the computable number field","volume":"15","author":"Aberth","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB2","series-title":"Computable Analysis","author":"Aberth","year":"1980"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB3","first-page":"115","article-title":"Th\u00e8se de doctorat d\u2019\u00e9tat, publication LITP","volume":"7","author":"Cegielski","year":"1990","journal-title":"Universit\u00e9 Paris"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB4","unstructured":"P. Cegielski, La th\u00e9orie des corps inductifs archim\u00e9diens rationnellement complets, C.R. Acad. Sci. Paris, 1990."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB5","unstructured":"P. Cegielski, Le th\u00e9or\u00e8me de Dirichlet est finitiste, publication LITP, Universit\u00e9 Paris 7, 1992."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB6","series-title":"Prime Numbers","author":"Ellison","year":"1985"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB7","series-title":"Metamathematics of First Order Arithmetic","author":"Hajek","year":"1993"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB8","series-title":"Models of Peano Arithmetic","author":"Kaye","year":"1991"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB9","unstructured":"Y. Matiassevitch, Tenth Hilbert Problem, MIT Press, Cambridge, MA, 1994; fr. tr. Le Dixi\u00e8me probl\u00e8me de Hilbert, Masson, Paris, 1995."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB10","unstructured":"G.E. Mints, What can be done with PRA?, Steklova Akad. Nauk SSSR 60 (1976) 93\u2013102 (in Russian); English Trans. in J. Soviet. Math. 14 (1980) 1487\u20131492."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB11","series-title":"Computability in Analysis and Physics","author":"Pour-El","year":"1988"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB12","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2307\/2266510","article-title":"Definability and decision problems in arithmetic","volume":"47","author":"Robinson","year":"1949","journal-title":"J. Symb. Logic"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB13","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB14","unstructured":"Simpson, Subsystems of Z2 and reverse mathematics, in: Takeuti, Proof Theory, North-Holland, Amsterdam, 1987, 432\u2013433."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB15","doi-asserted-by":"crossref","unstructured":"E. Specker, Nicht konstruktiv beweisbare S\u00e4tze der Analysis, J. Symb. Logic 14 271\u2013358.","DOI":"10.1007\/978-3-0348-9259-9_2"},{"key":"10.1016\/S0304-3975(00)00116-X_BIB16","unstructured":"E. Specker, Der Satz von Maximum in der rekursiven Analysis, Constructivity in Math. (1957) 254\u2013265."},{"key":"10.1016\/S0304-3975(00)00116-X_BIB17","series-title":"Two Applications of Logic to Mathematics","author":"Takeuti","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000116X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000116X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T06:20:38Z","timestamp":1556778038000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000116X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S030439750000116X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00116-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}