{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:01:50Z","timestamp":1759147310999},"reference-count":15,"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)00110-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"79-84","source":"Crossref","is-referenced-by-count":3,"title":["On end extensions of models of subsystems of peano arithmetic"],"prefix":"10.1016","volume":"257","author":[{"given":"C.","family":"Dimitracopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00110-9_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.4064\/fm-127-2-163-170","article-title":"A note on the MacDowell\u2013Specker theorem","volume":"127","author":"Clote","year":"1986","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(00)00110-9_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.4064\/fm-158-3-301-302","article-title":"Addendum to \u201cA note on the MacDowell\u2013Specker theorem\u201d","volume":"158","author":"Clote","year":"1998","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(00)00110-9_BIB3","doi-asserted-by":"crossref","unstructured":"Ch. Cornaros, C. Dimitracopoulos, A note on end extensions, Arch. Math. Logic39 (2000).","DOI":"10.1007\/s001530050158"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB4","series-title":"Metamathematics of First-order Arithmetic","author":"H\u00e1jek","year":"1993"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1008335.1008336","article-title":"Independence results in computer science","volume":"8","author":"Hartmanis","year":"1976","journal-title":"SIGACT News"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB6","series-title":"Grundlagen der Mathematik","author":"Hilbert","year":"1939"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB7","first-page":"103","article-title":"A survey of some recent results on computational complexity in weak theories of arithmetic","volume":"8","author":"Joseph","year":"1985","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00110-9_BIB8","doi-asserted-by":"crossref","unstructured":"M. Kaufmann, On existence of \u03a3n end extensions, Lecture Notes in Mathematics, Vol. 859, Springer, Berlin, 1980, pp. 92\u2013108.","DOI":"10.1007\/BFb0090942"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB9","unstructured":"A. Macintyre, The strength of weak systems, Proc. 11th Wittgenstein Symp., Kirchberg\/Wechsel, Austria, H\u00f6lder-Pichler-Tempsky, Wien, 1987, pp. 43\u201359."},{"key":"10.1016\/S0304-3975(00)00110-9_BIB10","unstructured":"R. MacDowell, E. Specker, Modelle der Arithmetik, Infinitistic methods, Proc. Symp. on Found. of Math., Warsaw, 1959, Pergamon Press, Oxford, 1961, pp. 257\u2013263."},{"key":"10.1016\/S0304-3975(00)00110-9_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1090\/S0002-9947-1978-0487048-9","article-title":"Completeness theorems, incompleteness theorems and models of arithmetic","volume":"239","author":"McAloon","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00110-9_BIB12","doi-asserted-by":"crossref","unstructured":"J. Paris, Some conservation results for fragments of arithmetic, Lecture Notes in Mathematics, Vol. 890, Springer, Berlin, 1981, pp. 251\u2013262.","DOI":"10.1007\/BFb0095667"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB13","doi-asserted-by":"crossref","unstructured":"J. Paris, L.A.S. Kirby, \u03a3n-Collection schemas in arithmetic, Logic Colloquium \u201977, North-Holland, Amsterdam, 1978, pp. 199\u2013209.","DOI":"10.1016\/S0049-237X(08)72003-2"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB14","doi-asserted-by":"crossref","unstructured":"C. Parsons, On a number-theoretic choice schema and its relation to induction, in: Kino, Myhill, Vesley (Eds.), Intuitionism and Proof Theory, North-Holland, Amsterdam, 1970, pp. 459\u2013473.","DOI":"10.1016\/S0049-237X(08)70771-7"},{"key":"10.1016\/S0304-3975(00)00110-9_BIB15","doi-asserted-by":"crossref","unstructured":"A.J. Wilkie, Applications of complexity theory to \u03a30-definability problems in arithmetic, Lecture Notes in Mathematics, Vol. 834, Springer, Berlin, 1980, pp. 363\u2013369.","DOI":"10.1007\/BFb0090174"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001109?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001109?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T22:16:24Z","timestamp":1680819384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0304397500001109"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00110-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}