{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T05:13:40Z","timestamp":1778649220267,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1969,4,1]],"date-time":"1969-04-01T00:00:00Z","timestamp":-23760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1969,4,1]],"date-time":"1969-04-01T00:00:00Z","timestamp":-23760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100005492","name":"Stanford University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005492","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["GE-9833"],"award-info":[{"award-number":["GE-9833"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["GP-4596"],"award-info":[{"award-number":["GP-4596"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["GP-185 1"],"award-info":[{"award-number":["GP-185 1"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1969,4]]},"DOI":"10.1016\/0020-0255(69)90016-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"189-204","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Strong representability of partial functions in arithmetic theories"],"prefix":"10.1016","volume":"1","author":[{"given":"Robert W.","family":"Ritchie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul R.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(69)90016-4_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01977641","article-title":"Representability of recursively enumerable sets in formal theories","volume":"5","author":"Ehrenfeucht","year":"1960","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"10.1016\/0020-0255(69)90016-4_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.4064\/fm-49-1-35-92","article-title":"Arithmetization of metamathematics in a general setting","volume":"49","author":"Feferman","year":"1960","journal-title":"Fund. Math."},{"key":"10.1016\/0020-0255(69)90016-4_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2964649","article-title":"Transfinite recursive progressions of theories","volume":"27","author":"Feferman","year":"1962","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0020-0255(69)90016-4_BIB4","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF02025806","article-title":"1-Consistency and faithful interpretations","volume":"6","author":"Feferman","year":"1962","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"10.1016\/0020-0255(69)90016-4_BIB5","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9947-1965-0175771-6","article-title":"Theory of provable recursive functions","volume":"117","author":"Fischer","year":"1965","journal-title":"Trans. Amer. Math, Soc."},{"key":"10.1016\/0020-0255(69)90016-4_BIB6","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0020-0255(69)90016-4_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/2964396","article-title":"Mathematical significance of consistency proofs","volume":"23","author":"Kreisel","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0020-0255(69)90016-4_BIB8","first-page":"574","article-title":"Exact separation of recursively enumerable sets within theories","volume":"11","author":"Putnam","year":"1960"},{"key":"10.1016\/0020-0255(69)90016-4_BIB9","first-page":"647","article-title":"Representability of partial recursive functions in formal theories","volume":"18","author":"Ritter","year":"1967"},{"key":"10.1016\/0020-0255(69)90016-4_BIB10","series-title":"mimeographed notes","volume":"Vol. I","author":"Rogers","year":"1957"},{"key":"10.1016\/0020-0255(69)90016-4_BIB11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01974157","article-title":"Representability of recursively enumerable sets in formal theories","volume":"5","author":"Shepherdson","year":"1960","journal-title":"Archiv. Math. Logik Grundlagenforsch."},{"key":"10.1016\/0020-0255(69)90016-4_BIB12","article-title":"Theory of Formal Systems","author":"Smullyan","year":"1961"},{"key":"10.1016\/0020-0255(69)90016-4_BIB13","series-title":"Undecidable Theories","author":"Tarski","year":"1953"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025569900164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025569900164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:39:38Z","timestamp":1778647178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025569900164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1969,4]]}},"alternative-id":["0020025569900164"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(69)90016-4","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1969,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strong representability of partial functions in arithmetic theories","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0255(69)90016-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1969 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}