{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:49:53Z","timestamp":1773233393542,"version":"3.50.1"},"reference-count":19,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1380,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We construct a computable \u2135<jats:sub>0<\/jats:sub>-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic.<\/jats:p>","DOI":"10.2178\/jsl\/1268917501","type":"journal-article","created":{"date-parts":[[2010,3,18]],"date-time":"2010-03-18T13:05:57Z","timestamp":1268917557000},"page":"728-740","source":"Crossref","is-referenced-by-count":3,"title":["A computable \u2135<sub>0<\/sub>-categorical structure whose theory computes true arithmetic"],"prefix":"10.1017","volume":"75","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Montalb\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200002747_ref019","doi-asserted-by":"publisher","DOI":"10.4064\/fm-98-2-121-125"},{"key":"S0022481200002747_ref017","doi-asserted-by":"publisher","DOI":"10.1007\/BF02757002"},{"key":"S0022481200002747_ref016","first-page":"397","volume":"46","author":"Millar","year":"1981","journal-title":"Vaught's theorem recursively revisited"},{"key":"S0022481200002747_ref013","first-page":"192","article-title":"Constructivizable models of undecidable theories","volume":"21","author":"Kudaibergenov","year":"1980","journal-title":"Sibirski\u012d Matematicheski\u012d Zhurnal"},{"key":"S0022481200002747_ref011","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1305\/ndjfl\/1039724885","article-title":"Computable models of theories with few models","volume":"38","author":"Khoussainov","year":"1997","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"S0022481200002747_ref008","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574"},{"key":"S0022481200002747_ref007","first-page":"305","volume":"39","author":"Harrington","year":"1974","journal-title":"Recursively presentable prime models"},{"key":"S0022481200002747_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/BF02219289"},{"key":"S0022481200002747_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF02218728"},{"key":"S0022481200002747_ref012","first-page":"106","volume":"59","author":"Knight","year":"1994","journal-title":"Nonarithmetical \u21350-categorical theories with recursive models"},{"key":"S0022481200002747_ref014","first-page":"59","volume":"44","author":"Lerman","year":"1979","journal-title":"Theories with recursive models"},{"key":"S0022481200002747_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(78)90030-X"},{"key":"S0022481200002747_ref004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-03-06951-X"},{"key":"S0022481200002747_ref009","first-page":"1177","volume-title":"Handbook of recursive mathematics, volume 2","volume":"139","author":"Khisamiev","year":"1998"},{"key":"S0022481200002747_ref005","doi-asserted-by":"publisher","DOI":"10.1023\/B:ALLO.0000048826.92325.02"},{"key":"S0022481200002747_ref018","first-page":"436","article-title":"A criterion of strong constructivizability of a homogeneous model","volume":"17","author":"Peretjatkin","year":"1978","journal-title":"Algebra i Logika"},{"key":"S0022481200002747_ref010","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-07-08865-X"},{"key":"S0022481200002747_ref001","volume-title":"Computable structures and the hyperarithmetical hierarchy","volume":"144","author":"Ash","year":"2000"},{"key":"S0022481200002747_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/BF01674776"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200002747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:37:44Z","timestamp":1556480264000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200002747\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0022481200002747"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1268917501","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}