{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:40:44Z","timestamp":1757616044792,"version":"3.44.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087394"},{"type":"electronic","value":"9783031087400"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08740-0_2","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T14:33:51Z","timestamp":1656167631000},"page":"13-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Well-Orders Realized by\u00a0C.E. Equivalence Relations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2429-5096","authenticated-orcid":false,"given":"Maxim","family":"Zubkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-50062-1_25","volume-title":"Computability and Complexity","author":"U Andrews","year":"2017","unstructured":"Andrews, U., Badaev, S., Sorbi, A.: A survey on universal computably enumerable equivalence relations. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 418\u2013451. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_25"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Andrews, U., Schweber, N., Sorbi, A.: The theory of ceers computes true arithmetic. Ann. Pure Appl. Logic 171(8), 102811 (2020). https:\/\/doi.org\/10.1016\/j.apal.2020.102811","DOI":"10.1016\/j.apal.2020.102811"},{"issue":"3\u20134","key":"2_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3233\/COM-180098","volume":"8","author":"U Andrews","year":"2019","unstructured":"Andrews, U., Sorbi, A.: Joins and meets in the structure of ceers. Computability 8(3\u20134), 193\u2013241 (2019). https:\/\/doi.org\/10.3233\/COM-180098","journal-title":"Computability"},{"key":"2_CR4","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144. Elsevier Science B.V., Amsterdam (2000)"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Bazhenov, N., Mustafa, M., Stephan, F., Yamaleev, M.: Boolean algebras realized by C.E. equivalence relations. Sib. Elektron. Mat. Izv. 14, 848\u2013855 (2017). https:\/\/doi.org\/10.17377\/semi.2017.14.071","DOI":"10.17377\/semi.2017.14.071"},{"issue":"10","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1073\/pnas.44.10.1061","volume":"44","author":"WW Boone","year":"1958","unstructured":"Boone, W.W.: The word problem. Proc. Natl. Acad. Sci. U.S.A. 44(10), 1061\u20131065 (1958). https:\/\/doi.org\/10.1073\/pnas.44.10.1061","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/malq.202000021","volume":"66","author":"V Delle Rose","year":"2020","unstructured":"Delle Rose, V., San Mauro, L., Sorbi, A.: Word problems and ceers. Math. Log. Q. 66(3), 341\u2013354 (2020). https:\/\/doi.org\/10.1002\/malq.202000021","journal-title":"Math. Log. Q."},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4305-3","volume-title":"Constructive Models","author":"YL Ershov","year":"2000","unstructured":"Ershov, Y.L., Goncharov, S.S.: Constructive Models. Kluwer Academic\/Plenum Publishers, New York (2000)"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Fokina, E., Khoussainov, B., Semukhin, P., Turetsky, D.: Linear orders realized by C.E. equivalence relations. J. Symb. Log. 81(2), 463\u2013482 (2016). https:\/\/doi.org\/10.1017\/jsl.2015.11","DOI":"10.1017\/jsl.2015.11"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Gavruskin, A., Jain, S., Khoussainov, B., Stephan, F.: Graphs realised by R.E. equivalence relations. Ann. Pure Appl. Logic 165(7\u20138), 1263\u20131290 (2014). https:\/\/doi.org\/10.1016\/j.apal.2014.04.001","DOI":"10.1016\/j.apal.2014.04.001"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2015.11.042","volume":"612","author":"A Gavryushkin","year":"2016","unstructured":"Gavryushkin, A., Khoussainov, B., Stephan, F.: Reducibilities among equivalence relations induced by recursively enumerable structures. Theor. Comput. Sci. 612, 137\u2013152 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.11.042","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-662-55386-2_10","volume-title":"Logic, Language, Information, and Computation","author":"MT Godziszewski","year":"2017","unstructured":"Godziszewski, M.T., Hamkins, J.D.: Computable quotient presentations of models of arithmetic and set theory. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 140\u2013152. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55386-2_10"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-94418-0_1","volume-title":"Sailing Routes in the World of Computation","author":"B Khoussainov","year":"2018","unstructured":"Khoussainov, B.: A journey to computably enumerable structures (tutorial lectures). In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 1\u201319. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94418-0_1"},{"key":"2_CR14","first-page":"1","volume":"44","author":"PS Novikov","year":"1955","unstructured":"Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Proc. Steklov Inst. Math. 44, 1\u2013143 (1955). (in Russian)","journal-title":"Proc. Steklov Inst. Math."},{"key":"2_CR15","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol. 125. Elsevier Science B.V., Amsterdam (1992)"},{"key":"2_CR16","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics, vol. 98. Academic Press, New York (1982)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-80049-9_41","volume-title":"Connecting with Computability","author":"A Sorbi","year":"2021","unstructured":"Sorbi, A.: Effective inseparability and its applications. In: De Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 417\u2013423. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_41"}],"container-title":["Lecture Notes in Computer Science","Revolutions and Revelations in Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08740-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:12:45Z","timestamp":1757092365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08740-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087394","9783031087400"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08740-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Swansea","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.swansea.ac.uk\/cie2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}