{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:12:14Z","timestamp":1784527934059,"version":"3.55.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030148119","type":"print"},{"value":"9783030148126","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_3","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"28-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computable Isomorphisms of Distributive Lattices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8259-4441","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8682-2392","authenticated-orcid":false,"given":"Mars","family":"Yamaleev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Andrews, U., Sorbi, A.: Joins and meets in the structure of ceers. Computability, Published online. https:\/\/doi.org\/10.3233\/COM-180098","DOI":"10.3233\/COM-180098"},{"key":"3_CR2","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"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/jsl.2013.8","volume":"79","author":"U Andrews","year":"2014","unstructured":"Andrews, U., Lempp, S., Miller, J.S., Ng, K.M., San Mauro, L., Sorbi, A.: Universal computably enumerable equivalence relations. J. Symb. Logic 79(1), 60\u201388 (2014). https:\/\/doi.org\/10.1017\/jsl.2013.8","journal-title":"J. Symb. Logic"},{"issue":"2","key":"3_CR4","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). https:\/\/doi.org\/10.1090\/S0002-9947-1986-0860377-7","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"3_CR5","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. Log. 46(3), 211\u2013234 (1990). https:\/\/doi.org\/10.1016\/0168-0072(90)90004-L","journal-title":"Ann. Pure Appl. Log."},{"key":"3_CR6","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"CJ Ash","year":"2000","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":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-94418-0_4","volume-title":"Sailing Routes in the World of Computation","author":"N Bazhenov","year":"2018","unstructured":"Bazhenov, N., Marchuk, M.: Degrees of categoricity for prime and homogeneous models. In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 40\u201349. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94418-0_4"},{"key":"3_CR8","unstructured":"Bazhenov, N., Mustafa, M., San Mauro, L., Sorbi, A., Yamaleev, M.: Classifying equivalence relations in the Ershov hierarchy. arXiv:1810.03559"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1134\/S1995080217040035","volume":"38","author":"NA Bazhenov","year":"2017","unstructured":"Bazhenov, N.A.: Effective categoricity for distributive lattices and Heyting algebras. Lobachevskii J. Math. 38(4), 600\u2013614 (2017). https:\/\/doi.org\/10.1134\/S1995080217040035","journal-title":"Lobachevskii J. Math."},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01837553","volume":"40","author":"C Bernardi","year":"1981","unstructured":"Bernardi, C.: On the relation provable equivalence and on partitions in effectively inseparable sets. Stud. Log. 40(1), 29\u201337 (1981). https:\/\/doi.org\/10.1007\/BF01837553","journal-title":"Stud. Log."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.2307\/2273443","volume":"48","author":"C Bernardi","year":"1983","unstructured":"Bernardi, C., Sorbi, A.: Classifying positive equivalence relations. J. Symb. Logic 48(3), 529\u2013538 (1983). https:\/\/doi.org\/10.2307\/2273443","journal-title":"J. Symb. Logic"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/BF02218645","volume":"10","author":"YL Ershov","year":"1971","unstructured":"Ershov, Y.L.: Positive equivalences. Algebra Log. 10(6), 378\u2013394 (1971). https:\/\/doi.org\/10.1007\/BF02218645","journal-title":"Algebra Log."},{"key":"3_CR13","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-32621-9_2","volume-title":"Logic, Language, Information and Computation","author":"E Fokina","year":"2012","unstructured":"Fokina, E., Friedman, S., Nies, A.: Equivalence relations that are $$\\varSigma ^0_3$$ complete for computable reducibility. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 26\u201333. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32621-9_2"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.2178\/jsl\/1327068695","volume":"77","author":"EB Fokina","year":"2012","unstructured":"Fokina, E.B., Friedman, S., Harizanov, V., Knight, J.F., McCoy, C., Montalb\u00e1n, A.: Isomorphism relations on computable structures. J. Symb. Logic 77(1), 122\u2013132 (2012). https:\/\/doi.org\/10.2178\/jsl\/1327068695","journal-title":"J. Symb. Logic"},{"key":"3_CR16","series-title":"Lecture Notes in Logic","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1017\/CBO9781107338579.006","volume-title":"Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic","author":"EB Fokina","year":"2014","unstructured":"Fokina, E.B., Harizanov, V., Melnikov, A.: Computable model theory. In: Downey, R. (ed.) Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic. Lecture Notes in Logic, vol. 42, pp. 124\u2013194. Cambridge University Press, Cambridge (2014)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1010521410739","volume":"67","author":"S Gao","year":"2001","unstructured":"Gao, S., Gerdes, P.: Computably enumerable equivalence relations. Stud. Log. 67(1), 27\u201359 (2001). https:\/\/doi.org\/10.1023\/A:1010521410739","journal-title":"Stud. Log."},{"key":"3_CR18","series-title":"Siberian School of Algebra and Logic","volume-title":"Countable Boolean Algebras and Decidability","author":"SS Goncharov","year":"1997","unstructured":"Goncharov, S.S.: Countable Boolean Algebras and Decidability. Siberian School of Algebra and Logic. Consultants Bureau, New York (1997)"},{"issue":"6","key":"3_CR19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1021758312697","volume":"41","author":"SS Goncharov","year":"2002","unstructured":"Goncharov, S.S., Knight, J.F.: Computable structure and non-structure theorems. Algebra Log. 41(6), 351\u2013373 (2002). https:\/\/doi.org\/10.1023\/A:1021758312697","journal-title":"Algebra Log."},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"G Gr\u00e4tzer","year":"2011","unstructured":"Gr\u00e4tzer, G.: Lattice Theory: Foundation. Birkh\u00e4user\/Springer, Basel (2011). https:\/\/doi.org\/10.1007\/978-3-0348-0018-1"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1017\/jsl.2013.33","volume":"79","author":"E Ianovski","year":"2014","unstructured":"Ianovski, E., Miller, R., Ng, K.M., Nies, A.: Complexity of equivalence relations and preorders from computability theory. J. Symb. Logic 79(3), 859\u2013881 (2014). https:\/\/doi.org\/10.1017\/jsl.2013.33","journal-title":"J. Symb. Logic"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-39053-1_37","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"AG Melnikov","year":"2013","unstructured":"Melnikov, A.G., Nies, A.: The classification problem for compact computable metric spaces. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 320\u2013328. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_37"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/malq.19550010205","volume":"1","author":"J Myhill","year":"1955","unstructured":"Myhill, J.: Creative sets. Z. Math. Logik Grundlagen Math. 1, 97\u2013108 (1955). https:\/\/doi.org\/10.1002\/malq.19550010205","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"3_CR24","unstructured":"Ng, K.M., Yu, H.: On the degree structure of equivalence relations under computable reducibility. Notre Dame J. Formal Log. (to appear)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-20028-6_29","volume-title":"Evolving Computability","author":"A Nies","year":"2015","unstructured":"Nies, A., Solecki, S.: Local compactness for computable polish metric spaces is $$\\varPi ^1_1$$-complete. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 286\u2013290. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20028-6_29"},{"key":"3_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"},{"key":"3_CR27","unstructured":"Turlington, A.: Computability of Heyting algebras and distributive lattices. Ph.D. thesis, University of Connecticut (2010)"},{"key":"3_CR28","first-page":"259","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"A Visser","year":"1980","unstructured":"Visser, A.: Numerations, $$\\lambda $$-calculus and arithmetic. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 259\u2013284. Academic Press, London (1980)"},{"key":"3_CR29","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:07:08Z","timestamp":1709824028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}