{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:37:49Z","timestamp":1648852669978},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T00:00:00Z","timestamp":1228953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00153-008-0111-5","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T10:07:19Z","timestamp":1228903639000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Preface"],"prefix":"10.1007","volume":"48","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Harizanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Marker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carol","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,11]]},"reference":[{"key":"111_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.apal.2005.10.002","volume":"141","author":"W. Calvert","year":"2006","unstructured":"Calvert W., Cenzer D., Harizanov V., Morozov A.: Effective categoricity of equivalence structures. Ann. Pure Appl. Logic 141, 61\u201378 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"111_CR2","doi-asserted-by":"crossref","unstructured":"Calvert, W., Goncharov, S.S., Knight, J.F.: Computable structures of Scott rank $${\\omega_1^{CK}}$$ in familiar classes. In: Gao, S., Jackson, S., Zhang, Y. (eds.) Advances in Logic. Con. Math., vol. 45, pp. 49\u201366 (2007)","DOI":"10.1090\/conm\/425\/08117"},{"key":"111_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.2178\/jsl\/1140641175","volume":"71","author":"W. Calvert","year":"2006","unstructured":"Calvert W., Knight J.F., Millar J.: Computable trees of Scott rank $${\\omega_1^{CK}}$$ , and computable approximability. J. Symb. Logic 71, 283\u2013298 (2006)","journal-title":"J. Symb. Logic"},{"key":"111_CR4","doi-asserted-by":"crossref","unstructured":"Cenzer D., Remmel, J.B.: Complexity-theoretic model theory and algebra. In: Ershov, Y., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol. I. Studies in Logic and Found. Math., vol. 138, pp. 381\u2013513 (1998)","DOI":"10.1016\/S0049-237X(98)80011-6"},{"key":"111_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2586747","volume":"64","author":"P. Cholak","year":"1999","unstructured":"Cholak P., Goncharov S., Khoussainov B., Shore R.A.: Computably categorical structures and expansions by constants. J. Symb. Logic 64, 13\u201337 (1999)","journal-title":"J. Symb. Logic"},{"key":"111_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1112\/jlms\/s2-18.3.385","volume":"18","author":"J. Denef","year":"1978","unstructured":"Denef J., Lipshitz L.: Diophantine sets over some rings of algebraic integers. J. London Math. Soc. 18, 385\u2013391 (1978)","journal-title":"J. London Math. Soc."},{"key":"111_CR7","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1007\/s00153-006-0019-x","volume":"45","author":"A. Dolich","year":"2006","unstructured":"Dolich A., Laskowski M.C., Raichev A.: Model completeness for trivial, uncountably categorical theories of Morley Rank 1. Arch. Math. Logic 45, 931\u2013945 (2006)","journal-title":"Arch. Math. Logic"},{"key":"111_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0168-0072(93)90075-O","volume":"60","author":"R.G. Downey","year":"1993","unstructured":"Downey R.G.: Every recursive Boolean algebra is isomorphic to one with incomplete atoms. Ann. Pure Appl. Logic 60, 193\u2013206 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"key":"111_CR9","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1090\/S0002-9947-1991-1005933-2","volume":"326","author":"R.G. Downey","year":"1991","unstructured":"Downey R.G., Moses M.F.: Recursive linear orders with incomplete successivities. Trans. Am. Math. Soc. 326, 653\u2013668 (1991)","journal-title":"Trans. Am. Math. Soc."},{"key":"111_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1025971406116","volume":"42","author":"R.G. Downey","year":"2003","unstructured":"Downey R.G., Goncharov S.S., Hirschfeldt D.: Degree spectra of relations on Boolean algebras. Algebra and Logic 42, 105\u2013111 (2003)","journal-title":"Algebra and Logic"},{"key":"111_CR11","first-page":"45","volume":"19","author":"V.D. Dzgoev","year":"1980","unstructured":"Dzgoev V.D., Gon\u010darov S.S.: Autostability of models. Algebra i Logika 19, 45\u201358 (1980)","journal-title":"Algebra i Logika"},{"key":"111_CR12","doi-asserted-by":"crossref","unstructured":"Davis, M., Matiyasevich, Yu., Robinson, J.: Hilbert\u2019s tenth problem. Diophantine equations: Positive aspects of a negative solution. In: Proc. Sympos. Pure Math., vol. 28. Amer. Math. Soc., Providence, RI, pp. 323\u2013378 (1976)","DOI":"10.1090\/pspum\/028.2\/0432534"},{"key":"111_CR13","first-page":"621","volume":"19","author":"S.S. Gon\u010darov","year":"1980","unstructured":"Gon\u010darov S.S.: The problem of the number of nonautoequivalent constructivizations. Algebra i Logika 19, 621\u2013639 (1980)","journal-title":"Algebra i Logika"},{"key":"111_CR14","doi-asserted-by":"crossref","first-page":"3901","DOI":"10.1090\/S0002-9939-03-06951-X","volume":"131","author":"S.S. Goncharov","year":"2003","unstructured":"Goncharov S.S., Harizanov V.S., Laskowski M.C., Lempp S., McCoy C.F.D.: Trivial, strongly minimal theories are model complete after naming constants. Proc. Am. Math. Soc. 131, 3901\u20133912 (2003)","journal-title":"Proc. Am. Math. Soc."},{"key":"111_CR15","doi-asserted-by":"crossref","first-page":"923","DOI":"10.2307\/2695053","volume":"66","author":"E. Herrmann","year":"2001","unstructured":"Herrmann E.: Infinite chains and antichains in computable partial orderings. J. Symb. 66, 923\u2013934 (2001)","journal-title":"J. Symb."},{"key":"111_CR16","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1002\/cpa.3160420805","volume":"42","author":"H.N. Shapiro","year":"1989","unstructured":"Shapiro H.N., Shlapentokh A.: Diophantine relations between algebraic number fields. Comm. Pure Appl. Math. 42, 1113\u20131122 (1989)","journal-title":"Comm. Pure Appl. Math."},{"key":"111_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.2307\/2272972","volume":"37","author":"C.G. Jockusch Jr","year":"1972","unstructured":"Jockusch C.G. Jr: Ramsey\u2019s theorem and recursion theory. J. Symb. Logic 37, 268\u2013280 (1972)","journal-title":"J. Symb. Logic"},{"key":"111_CR18","first-page":"479","volume":"27","author":"B.M. Khoussainov","year":"1988","unstructured":"Khoussainov B.M.: The algorithmic dimension of unars. Algebra i Logika 27, 479\u2013494 (1988)","journal-title":"Algebra i Logika"},{"key":"111_CR19","doi-asserted-by":"crossref","first-page":"3711","DOI":"10.1090\/S0002-9939-07-08865-X","volume":"135","author":"B.M. Khoussainov","year":"2007","unstructured":"Khoussainov B.M., Laskowski M.C., Lempp S., Solomon R.: On the computability-theoretic complexity of trivial, strongly minimal models. Proc. Am. Math. Soc. 135, 3711\u20133721 (2007)","journal-title":"Proc. Am. Math. Soc."},{"key":"111_CR20","doi-asserted-by":"crossref","first-page":"921","DOI":"10.2307\/2274752","volume":"54","author":"D. Marker","year":"1989","unstructured":"Marker D.: Non $${\\Sigma_{n}}$$ axiomatizable almost strongly trivial theories. J. Symb. Logic 54, 921\u2013927 (1989)","journal-title":"J. Symb. Logic"},{"key":"111_CR21","volume-title":"Model Theory. An Introduction. Graduate Texts in Mathematics, vol. 217","author":"D. Marker","year":"2002","unstructured":"Marker D.: Model Theory. An Introduction. Graduate Texts in Mathematics, vol. 217. Springer, Berlin (2002)"},{"key":"111_CR22","doi-asserted-by":"crossref","unstructured":"Millar, J., Sacks, G.E.: Atomic models higher up. Ann. Pure Appl. Logic (to appear)","DOI":"10.1016\/j.apal.2008.04.004"},{"key":"111_CR23","doi-asserted-by":"crossref","first-page":"528","DOI":"10.2307\/2275848","volume":"60","author":"A. Pillay","year":"1995","unstructured":"Pillay A., Poizat B.: Corps at chirurgie. J. Symb. Logic 60, 528\u2013533 (1995)","journal-title":"J. Symb. Logic"},{"key":"111_CR24","doi-asserted-by":"crossref","first-page":"572","DOI":"10.2307\/2273757","volume":"46","author":"J.B. Remmel","year":"1981","unstructured":"Remmel J.B.: Recursive isomorphism types of recursive Boolean algebras. J. Symb. Logic 46, 572\u2013594 (1981)","journal-title":"J. Symb. Logic"},{"key":"111_CR25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1981-0624937-1","volume":"83","author":"J.B. Remmel","year":"1981","unstructured":"Remmel J.B.: Recursively categorical linear orderings. Proc. Am. Math. Soc. 83, 387\u2013391 (1981)","journal-title":"Proc. Am. Math. Soc."},{"key":"111_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542954","volume-title":"Hilbert\u2019s Tenth Problem: Diophantine Classes and Extensions to Global Fields","author":"A. Shlapentokh","year":"2006","unstructured":"Shlapentokh A.: Hilbert\u2019s Tenth Problem: Diophantine Classes and Extensions to Global Fields. Cambridge University Press, London (2006)"},{"key":"111_CR27","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1016\/j.jalgebra.2006.11.007","volume":"313","author":"A. Shlapentokh","year":"2007","unstructured":"Shlapentokh A.: Diophantine definability and decidability in the extensions of degree 2 of totally real fields. J. Algebra 313, 846\u2013896 (2007)","journal-title":"J. Algebra"},{"key":"111_CR28","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01979010","volume":"25","author":"Y.G. Ventsov","year":"1986","unstructured":"Ventsov Y.G.: Algorithmic properties of branching models. Algebra i Logika 25, 369\u2013383 (1986)","journal-title":"Algebra i Logika"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0111-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0111-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0111-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:36:42Z","timestamp":1558640202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0111-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,11]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0111-5","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,11]]}}}