{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:25:48Z","timestamp":1773149148871,"version":"3.50.1"},"reference-count":12,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2006,1,1]]},"DOI":"10.1305\/ndjfl\/1143468311","type":"journal-article","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T08:08:18Z","timestamp":1143533298000},"source":"Crossref","is-referenced-by-count":8,"title":["An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated"],"prefix":"10.1215","volume":"47","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis R.","family":"Hirschfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Semukhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Baldwin, J. T., and A. H. Lachlan, \"On strongly minimal sets\", <i>The Journal of Symbolic Logic<\/i>, vol. 36 (1971), pp. 79--96.","DOI":"10.2307\/2271517"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Ershov, Yu. L., S. S. Goncharov, A. Nerode, J. B. Remmel, and V. W. Marek, editors, <i>Handbook of Recursive Mathematics. Vols. 1 and 2<\/i>, vols. 138 and 139 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80001-3"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Goncharov, S. S., \"Constructive models of $\\aleph \\sb1$\"-categorical theories, <i>Matematicheskie Zametki<\/i>, vol. 23 (1978), pp. 885--88. English translation: Mathematical Notes 23 (1978), pp. 486--88.","DOI":"10.1007\/BF01431432"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Harrington, L., \"Recursively presentable prime models\", <i>The Journal of Symbolic Logic<\/i>, vol. 39 (1974), pp. 305--309.","DOI":"10.2307\/2272643"},{"key":"5","unstructured":"[5] Khisamiev, N. G., \"On strongly constructive models of decidable theories\", <i>Izvestiya Akademii Nauk Kazakhsko\u012d SSR. Seriya Fiziko-Matematicheskaya<\/i>, (1974), pp. 83--84, 94."},{"key":"6","unstructured":"[6] Khisamiev, N. G., \"A constructibility criterion for the direct product of cyclic $p$\"-groups, <i>Izvestiya Akademii Nauk Kazakhsko\u012d SSR. Seriya Fiziko-Matematicheskaya<\/i>, (1981), pp. 51--55, 86."},{"key":"7","unstructured":"[7] Khisamiev, N. G., \"Theory of Abelian groups with constructive models\", <i>Sibirski\u012d Matematicheski\u012d Zhurnal<\/i>, vol. 27 (1986), pp. 572--85. Translation from Sib. Mat. Zh. 27, No.4(158), pp. 128--143, 215."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Khisamiev, N. G., \"Constructive Abelian groups\", pp. 1177--1231 in <i>Handbook of Recursive Mathematics, Vol. 2<\/i>, edited by Yu. L. Ershov, S. S. Goncharov, A. Nerode, J. B. Remmel, and V. W. Marek, vol. 139 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80050-5"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Khoussainov, B., A. Nies, and R. A. Shore, \"Computable models of theories with few models\", <i>Notre Dame Journal of Formal Logic<\/i>, vol. 38 (1997), pp. 165--78.","DOI":"10.1305\/ndjfl\/1039724885"},{"key":"10","unstructured":"[10] Kuda\u012dbergenov, K. \u017d., \"Constructivizable models of undecidable theories\", <i>Sibirski\u012d Matematicheski\u012d Zhurnal<\/i>, vol. 21 (1980), pp. 155--58, 192."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Nies, A., \"A new spectrum of recursive models\", <i>Notre Dame Journal of Formal Logic<\/i>, vol. 40 (1999), pp. 307--14.","DOI":"10.1305\/ndjfl\/1022615611"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Soare, R. I., <i>Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1143468311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:56:34Z","timestamp":1706648194000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-47\/issue-1\/An-Uncountably-Categorical-Theory-Whose-Only-Computably-Presentable-Model-Is\/10.1305\/ndjfl\/1143468311.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,1]]},"references-count":12,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2006,1,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1143468311","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2006,1,1]]}}}