{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:39:31Z","timestamp":1775464771882,"version":"3.50.1"},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1837,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the following open question in computable model theory: does there exist a structure of computable dimension two which is the prime model of its first-order theory? We construct an example of such a structure by coding a certain family of c.e. sets with exactly two one-to-one computable enumerations into a directed graph. We also show that there are examples of such structures in the classes of undirected graphs, partial orders, lattices, and integral domains.<\/jats:p>","DOI":"10.2178\/jsl\/1231082315","type":"journal-article","created":{"date-parts":[[2009,1,4]],"date-time":"2009-01-04T10:18:44Z","timestamp":1231064324000},"page":"336-348","source":"Crossref","is-referenced-by-count":1,"title":["Prime models of finite computable dimension"],"prefix":"10.1017","volume":"74","author":[{"given":"Pavel","family":"Semukhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200003856_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(97)00059-6"},{"key":"S0022481200003856_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00087-2"},{"key":"S0022481200003856_ref006","first-page":"1199","volume":"68","author":"Hirschfeldt","year":"2003","journal-title":"A computably categorical structure whose expansion by a constant has infinite computable dimension"},{"key":"S0022481200003856_ref005","unstructured":"Hirschfeldt D. R. , Degree spectra of relations on computable structures, Ph.D. thesis, Cornell University, 1999."},{"key":"S0022481200003856_ref001","first-page":"13","volume":"64","author":"Choiak","year":"1999","journal-title":"Computably categorical structures and expansions by constants"},{"key":"S0022481200003856_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01669607"},{"key":"S0022481200003856_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/BF01669323"},{"key":"S0022481200003856_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90190-O"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200003856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:00:24Z","timestamp":1556640024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200003856\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["S0022481200003856"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1231082315","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}