{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:21:25Z","timestamp":1743009685481,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_23","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"200-209","source":"Crossref","is-referenced-by-count":0,"title":["On Decidable and Computable Models of Theories"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Gavruskin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Baldwin, J., Berman, J.: Concrete representations of lattices and the fundamental order. Classification Theory, 24\u201331 (1987)","DOI":"10.1007\/BFb0082230"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/malq.200910001","volume":"56","author":"B. Csima","year":"2010","unstructured":"Csima, B., Kalimullin, I.: Degree spectra and immunity properties. Mathematical Logic Quarterly\u00a056(1), 67\u201377 (2010)","journal-title":"Mathematical Logic Quarterly"},{"key":"23_CR3","unstructured":"Gavruskin, A.: Computable limit models. In: Programs, Proofs, Processes\u2014CiE, pp. 188\u2013193 (2010)"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01674776","volume":"17","author":"S. Goncharov","year":"1978","unstructured":"Goncharov, S.: Strong constructivizability of homogeneous models. Algebra and Logic\u00a017(4), 247\u2013263 (1978)","journal-title":"Algebra and Logic"},{"key":"23_CR5","volume-title":"Constructive Models","author":"S. Goncharov","year":"2000","unstructured":"Goncharov, S., Ershov, Y.: Constructive Models. Consultants Bureau, New York (2000)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02219289","volume":"12","author":"S. Goncharov","year":"1973","unstructured":"Goncharov, S., Nurtazin, A.: Constructive models of complete solvable theories. Algebra and Logic\u00a012(2), 67\u201377 (1973)","journal-title":"Algebra and Logic"},{"key":"23_CR7","unstructured":"Greenberg, N., Montalb\u00e1n, A., Slaman, T.: Relative to any non-hyperarithmetic set. preprint arXiv:1110.1907 (2011)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2307\/2272643","volume":"39","author":"L. Harrington","year":"1974","unstructured":"Harrington, L.: Recursively presentable prime models. The Journal of Symbolic Logic\u00a039(2), 305\u2013309 (1974)","journal-title":"The Journal of Symbolic Logic"},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1090\/S0002-9939-05-08097-4","volume":"134","author":"D. Hirschfeldt","year":"2006","unstructured":"Hirschfeldt, D.: Computable trees, prime models, and relative decidability. Proceedings of the American Mathematical Society\u00a0134(5), 1495\u20131498 (2006)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"23_CR10","unstructured":"Hodges, W.: Model Theory. In: Encyclopaedia of Mathematics and Its Applications, vol.\u00a042, Cambridge University Press (1993)"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.2178\/jsl\/1191333855","volume":"72","author":"B. Khoussainov","year":"2007","unstructured":"Khoussainov, B., Semukhin, P., Stephan, F.: Applications of Kolmogorov complexity to computable model theory. The Journal of Symbolic Logic\u00a072(3), 1041\u20131054 (2007)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1305\/ndjfl\/1039724885","volume":"38","author":"B. Khoussainov","year":"1997","unstructured":"Khoussainov, B., Nies, A., Shore, R.: Computable models of theories with few models. Notre Dame Journal of Formal Logic\u00a038(2), 165\u2013178 (1997)","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.2178\/jsl\/1230396762","volume":"73","author":"K. Lange","year":"2008","unstructured":"Lange, K.: The degree spectra of homogeneous models. Journal of Symbolic Logic\u00a073(3), 1009\u20131028 (2008)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"330","DOI":"10.2307\/2273127","volume":"44","author":"D. Lascar","year":"1979","unstructured":"Lascar, D., Poizat, B.: An introduction to forking. The Journal of Symbolic Logic\u00a044(3), 330\u2013350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0003-4843(78)90030-X","volume":"13","author":"T. Millar","year":"1978","unstructured":"Millar, T.: Foundations of recursive model theory. Annals of Mathematical Logic\u00a013, 45\u201372 (1978)","journal-title":"Annals of Mathematical Logic"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2307\/2273331","volume":"48","author":"T. Millar","year":"1983","unstructured":"Millar, T.: Omitting types, type spectrums, and decidability. Journal of Symbolic Logic\u00a048(1), 171\u2013181 (1983)","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02757002","volume":"25","author":"M. Morley","year":"1976","unstructured":"Morley, M.: Decidable Models. Israel Journal of Mathematics\u00a025, 233\u2013240 (1976)","journal-title":"Israel Journal of Mathematics"},{"issue":"5","key":"23_CR18","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/BF02218589","volume":"12","author":"M. Peretyatkin","year":"1973","unstructured":"Peretyatkin, M.: On complete theories with a finite number of denumerable models. Algebra and Logic\u00a012(5), 310\u2013326 (1973)","journal-title":"Algebra and Logic"},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF01674780","volume":"17","author":"M. Peretyatkin","year":"1978","unstructured":"Peretyatkin, M.: Criterion for strong constructivizability of a homogeneous model. Algebra and Logic\u00a017(4), 290\u2013301 (1978)","journal-title":"Algebra and Logic"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"570","DOI":"10.2307\/2274014","volume":"51","author":"B. Poizat","year":"1986","unstructured":"Poizat, B.: Attention a la Marche! Journal of Symbolic Logic\u00a051(3), 570\u2013585 (1986)","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Sacks, G.: Saturated model theory, 2nd edn. World Scientific Publishing Company Incorporated (2010)","DOI":"10.1142\/6974"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1023\/B:ALLO.0000015131.41218.f4","volume":"43","author":"S. Sudoplatov","year":"2004","unstructured":"Sudoplatov, S.: Complete theories with finitely many countable models I, II. Algebra and Logic\u00a043(1), 62\u201369 (2004)","journal-title":"Algebra and Logic"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T14:28:09Z","timestamp":1675780089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}