{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:55:10Z","timestamp":1759146910109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_15","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"141-151","source":"Crossref","is-referenced-by-count":1,"title":["Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1090\/S0002-9947-1986-0860377-7","volume":"298","author":"CJ Ash","year":"1986","unstructured":"Ash, C.J.: Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees. Trans. Am. Math. Soc. 298(2), 497\u2013514 (1986). doi:\n10.1090\/S0002-9947-1986-0860377-7","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20133","key":"15_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0168-0072(01)00087-2","volume":"115","author":"DR Hirschfeldt","year":"2002","unstructured":"Hirschfeldt, D.R., Khoussainov, B., Shore, R.A., Slinko, A.M.: Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Logic 115(1\u20133), 71\u2013113 (2002). doi:\n10.1016\/S0168-0072(01)00087-2","journal-title":"Ann. Pure Appl. Logic"},{"issue":"6","key":"15_CR3","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 Logic 43(6), 374\u2013392 (2004). doi:\n10.1023\/B:ALLO.0000048827.30718.2c","journal-title":"Algebra Logic"},{"issue":"1\u20132","key":"15_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/malq.201020063","volume":"58","author":"EB Fokina","year":"2012","unstructured":"Fokina, E.B., Friedman, S.-D.: On \n            $$\\Sigma ^1_1$$\n           equivalence relations over the natural numbers. Math. Log. Q. 58(1\u20132), 113\u2013124 (2012). doi:\n10.1002\/malq.201020063","journal-title":"Math. Log. Q."},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Harrison-Trainor, M., Melnikov, A., Miller, R., Mont\u00e1lban, A.: Computable functors and effective interpretability. J. Symbolic Logic (to appear). doi:\n10.1017\/jsl.2016.12","DOI":"10.1017\/jsl.2016.12"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"894","DOI":"10.2307\/2274750","volume":"54","author":"H Friedman","year":"1989","unstructured":"Friedman, H., Stanley, L.: A Borel reducibility theory for classes of countable structures. J. Symbolic Logic 54(3), 894\u2013914 (1989). doi:\n10.2307\/2274750","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"901","DOI":"10.2178\/jsl\/1191333847","volume":"72","author":"JF Knight","year":"2007","unstructured":"Knight, J.F., Miller, S., Vanden Boom, M.: Turing computable embeddings. J. Symbolic Logic 72(3), 901\u2013918 (2007). doi:\n10.2178\/jsl\/1191333847","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.2178\/jsl\/1191333854","volume":"72","author":"J Chisholm","year":"2007","unstructured":"Chisholm, J., Knight, J.F., Miller, S.: Computable embeddings and strongly minimal theories. J. Symbolic Logic 72(3), 1031\u20131040 (2007). doi:\n10.2178\/jsl\/1191333854","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2178\/jsl\/1309952523","volume":"76","author":"E Fokina","year":"2011","unstructured":"Fokina, E., Knight, J.F., Melnikov, A., Quinn, S.M., Safranski, C.: Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symbolic Logic 76(3), 846\u2013869 (2011). doi:\n10.2178\/jsl\/1309952523","journal-title":"J. Symbolic Logic"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-30870-3_54","volume-title":"How the World Computes","author":"VA Ocasio-Gonz\u00e1lez","year":"2012","unstructured":"Ocasio-Gonz\u00e1lez, V.A.: Turing computable embeddings and coding families of sets. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 539\u2013548. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-30870-3_54"},{"issue":"6","key":"15_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10469-016-9368-7","volume":"54","author":"U Andrews","year":"2016","unstructured":"Andrews, U., Dushenin, D.I., Hill, C., Knight, J.F., Melnikov, A.G.: Comparing classes of finite sums. Algebra Logic 54(6), 489\u2013501 (2016). doi:\n10.1007\/s10469-016-9368-7","journal-title":"Algebra Logic"},{"key":"15_CR12","unstructured":"VanDenDriessche, S.M.: Embedding computable infinitary equivalence into \n            $$p$$\n          -groups. Ph.D. thesis, University of Notre Dame (2013)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1090\/S0002-9939-2014-11878-8","volume":"142","author":"M Wright","year":"2014","unstructured":"Wright, M.: Turing computable embeddings of equivalences other than isomorphism. Proc. Am. Math. Soc. 142, 1795\u20131811 (2014). doi:\n10.1090\/S0002-9939-2014-11878-8","journal-title":"Proc. Am. Math. Soc."},{"key":"15_CR14","first-page":"58","volume":"23","author":"SS Goncharov","year":"1981","unstructured":"Goncharov, S.S.: Groups with a finite number of constructivizations. Sov. Math. Dokl. 23, 58\u201361 (1981)","journal-title":"Sov. Math. Dokl."},{"key":"15_CR15","unstructured":"Ash, C.J., Knight, J.F.: Computable structures and the hyperarithmetical hierarchy. In: Studies in Logic and the Foundations of Mathematics, vol. 144. Elsevier Science B.V., Amsterdam (2000)"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1134\/S1995080214040192","volume":"35","author":"JF Knight","year":"2014","unstructured":"Knight, J.F.: Using computability to measure complexity of algebraic structures and classes of structures. Lobachevskii J. Math. 35(4), 304\u2013312 (2014). doi:\n10.1134\/S1995080214040192","journal-title":"Lobachevskii J. Math."},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0168-0072(90)90004-L","volume":"46","author":"CJ Ash","year":"1990","unstructured":"Ash, C.J., Knight, J.F.: Pairs of recursive structures. Ann. Pure Appl. Logic 46(3), 211\u2013234 (1990). doi:\n10.1016\/0168-0072(90)90004-L","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T09:01:43Z","timestamp":1504170103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}