{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:24:20Z","timestamp":1773235460397,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642030727","type":"print"},{"value":"9783642030734","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03073-4_21","type":"book-chapter","created":{"date-parts":[[2009,7,14]],"date-time":"2009-07-14T08:06:17Z","timestamp":1247558777000},"page":"198-207","source":"Crossref","is-referenced-by-count":11,"title":["Equivalence Relations on Classes of Computable Structures"],"prefix":"10.1007","author":[{"given":"Ekaterina B.","family":"Fokina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sy-David","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"C.J. Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2178\/jsl\/1107298523","volume":"70","author":"W. Calvert","year":"2005","unstructured":"Calvert, W.: The isomorphism problem for computable abelian p-groups of bounded length. J. Symbolic Logic\u00a070(1), 331\u2013345 (2005)","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00153-004-0219-1","volume":"43","author":"W. Calvert","year":"2004","unstructured":"Calvert, W.: The isomorphism problem for classes of computable fields. Arch. Math. Logic\u00a043(3), 327\u2013336 (2004)","journal-title":"Arch. Math. Logic"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1023\/B:ALLO.0000048827.30718.2c","volume":"43","author":"W. Calvert","year":"2004","unstructured":"Calvert, W., Cummins, D., Knight, J.F., Miller, S.: Comparing classes of finite structures. Algebra and Logic\u00a043, 374\u2013392 (2004)","journal-title":"Algebra and Logic"},{"key":"21_CR5","unstructured":"Carson, J., Fokina, E., Harizanov, V., Knight, J., Maher, C., Quinn, S., Wallbaum, J.: Computable Embedding Problem (submitted)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.jalgebra.2008.06.007","volume":"320","author":"R. Downey","year":"2008","unstructured":"Downey, R., Montalb\u00e1n, A.: The isomorphism problem for torsion-free Abelian groups is analytic complete. Journal of Algebra\u00a0320, 2291\u20132300 (2008)","journal-title":"Journal of Algebra"},{"key":"21_CR7","unstructured":"Ershov, Y.L.: Theory of numberings, Nauka, Moscow (1977)"},{"key":"21_CR8","unstructured":"Friedman, S.D., Motto Ros, L.: Analytic equivalence relations and bi-embeddability (2008) (preprint)"},{"key":"21_CR9","series-title":"International Mathematical Series","first-page":"99","volume-title":"Logics for the XXIst century","author":"S.S. Goncharov","year":"2006","unstructured":"Goncharov, S.S.: Computability and Computable Models, Mathematical problems from applied logic. II. In: Gabbay, D.M., Goncharov, S.S., Zakharyaschev, M. (eds.) Logics for the XXIst century. International Mathematical Series, pp. 99\u2013216. Springer, New York (2006)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1021758312697","volume":"41","author":"S.S. Goncharov","year":"2002","unstructured":"Goncharov, S.S., Knight, J.F.: Computable structure and non-structure theorems. Algebra and Logic\u00a041, 351\u2013373 (2002) (English translation)","journal-title":"Algebra and Logic"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0168-0072(01)00087-2","volume":"115","author":"D.R. Hirschfeldt","year":"2002","unstructured":"Hirschfeldt, D.R., Khoussainov, B., Shore, R.A., Slinko, A.M.: Degree spectra and computable dimensions in algebraic structures. Annals of Pure and Applied Logic\u00a0115, 71\u2013113 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/421088","volume":"5","author":"A. Kechris","year":"1999","unstructured":"Kechris, A.: New directions in descriptive set theory. Bull. Symbolic Logic\u00a05(2), 161\u2013174 (1999)","journal-title":"Bull. Symbolic Logic"},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"901","DOI":"10.2178\/jsl\/1191333847","volume":"72","author":"J. Knight","year":"2007","unstructured":"Knight, J., Miller, S., Vanden Boom, M.: Turing computable embeddings. J. Symbolic Logic\u00a072(3), 901\u2013918 (2007)","journal-title":"J. Symbolic Logic"},{"issue":"12","key":"21_CR14","doi-asserted-by":"publisher","first-page":"4839","DOI":"10.1090\/S0002-9947-05-04005-5","volume":"357","author":"A. Louveau","year":"2005","unstructured":"Louveau, A., Rosendal, C.: Complete analytic equivalence relations. Trans. Amer. Math. Soc.\u00a0357(12), 4839\u20134866 (2005)","journal-title":"Trans. Amer. Math. Soc."},{"key":"21_CR15","unstructured":"Nurtazin, A.T.: Computable classes and algebraic criteria for autostability, Ph.D. Thesis, Institute of Mathematics and Mechanics, Alma-Ata (1974)"},{"key":"21_CR16","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of recursive functions and effective computability. McGraw-Hill, New York (1967)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Theory and Computational Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03073-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T05:00:51Z","timestamp":1552107651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03073-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030727","9783642030734"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03073-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}