{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:22Z","timestamp":1784484142240,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_10","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:28:53Z","timestamp":1784482133000},"page":"150-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Computability of\u00a0Ideal 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"}]},{"given":"Stanislav","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013168. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"10_CR2","unstructured":"Ash, C.J., Knight, J.F.: Computable structures and the hyperarithmetical hierarchy. Stud. Logic Found. Math. 144 (2000)"},{"issue":"6","key":"10_CR3","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1134\/S0037446617060052","volume":"58","author":"NA Bazhenov","year":"2017","unstructured":"Bazhenov, N.A., Frolov, A.N., Kalimullin, I.S., Melnikov, A.G.: Computability of distributive lattices. Sib. Math. J. 58(6), 959\u2013970 (2017). https:\/\/doi.org\/10.1134\/S0037446617060052","journal-title":"Sib. Math. J."},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Bazhenov, N., Mustafa, M., Nurakunov, A.: On concept lattices for numberings. Tsinghua Sci. Technol. 29(6), 1642\u20131650 (2024). https:\/\/doi.org\/10.26599\/TST.2023.9010102","DOI":"10.26599\/TST.2023.9010102"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Bazhenov, N., Mustafa, M., Yamaleev, M.: Computable isomorphisms of distributive lattices. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 28\u201341. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_3","DOI":"10.1007\/978-3-030-14812-6_3"},{"issue":"3\u20134","key":"10_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.3233\/COM-230442","volume":"13","author":"M de Brecht","year":"2024","unstructured":"de Brecht, M., Kihara, T., Selivanov, V.: Ideal presentations and numberings of some classes of effective quasi-Polish spaces. Computability 13(3\u20134), 325\u2013348 (2024). https:\/\/doi.org\/10.3233\/COM-230442","journal-title":"Computability"},{"issue":"3\u20134","key":"10_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3233\/COM-190253","volume":"9","author":"M de Brecht","year":"2020","unstructured":"de Brecht, M., Pauly, A., Schr\u00f6der, M.: Overt choice. Computability 9(3\u20134), 169\u2013191 (2020). https:\/\/doi.org\/10.3233\/COM-190253","journal-title":"Computability"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-92433-0","volume-title":"Computable Structure Theory: A Unified Approach","author":"RG Downey","year":"2026","unstructured":"Downey, R.G., Melnikov, A.: Computable Structure Theory: A Unified Approach. Springer, Cham (2026)"},{"key":"10_CR9","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, New York (2000)"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)"},{"key":"10_CR11","volume-title":"Countable Boolean Algebras and Decidability","author":"SS Goncharov","year":"1997","unstructured":"Goncharov, S.S.: Countable Boolean Algebras and Decidability. Consultants Bureau, New York (1997)"},{"key":"10_CR12","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. Springer, Basel (2011)"},{"key":"10_CR13","volume-title":"Lattice Theory: Special Topics and Applications","year":"2014","unstructured":"Gr\u00e4tzer, G., Wehrung, F. (eds.): Lattice Theory: Special Topics and Applications, vol. 1. Springer, Basel (2014)"},{"issue":"5","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1090\/S0002-9939-05-08097-4","volume":"134","author":"DR Hirschfeldt","year":"2006","unstructured":"Hirschfeldt, D.R.: Computable trees, prime models, and relative decidability. Proc. Amer. Math. Soc. 134(5), 1495\u20131498 (2006). https:\/\/doi.org\/10.1090\/S0002-9939-05-08097-4","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1\u20133","key":"10_CR15","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). https:\/\/doi.org\/10.1016\/S0168-0072(01)00087-2","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2140\/pjm.1969.30.67","volume":"30","author":"CG Jockusch","year":"1969","unstructured":"Jockusch, C.G., McLaughlin, T.G.: Countable retracing functions and $$\\Pi ^0_2$$ predicates. Pacific J. Math. 30(1), 67\u201393 (1969). https:\/\/doi.org\/10.2140\/pjm.1969.30.67","journal-title":"Pacific J. Math."},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1134\/S0037446612050072","volume":"53","author":"SM Levental","year":"2012","unstructured":"Levental, S.M.: Study of a universal formal context. Sib. Math. J. 53(5), 810\u2013820 (2012). https:\/\/doi.org\/10.1134\/S0037446612050072","journal-title":"Sib. Math. J."},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s11202-009-0054-z","volume":"50","author":"AS Morozov","year":"2009","unstructured":"Morozov, A.S.: On effective presentations of formal concept lattices. Sib. Math. J. 50(3), 481\u2013494 (2009). https:\/\/doi.org\/10.1007\/s11202-009-0054-z","journal-title":"Sib. Math. J."},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11202-010-0029-0","volume":"51","author":"AS Morozov","year":"2010","unstructured":"Morozov, A.S.: On computable automorphisms in formal concept analysis. Sib. Math. J. 51(2), 289\u2013295 (2010). https:\/\/doi.org\/10.1007\/s11202-010-0029-0","journal-title":"Sib. Math. J."},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Morozov, A.S., L\u2019vova, M.A.: On computable formal concepts in computable formal contexts. Sib. Math. J. 48(5), 871\u2013878 (2007). https:\/\/doi.org\/10.1007\/s11202-007-0089-y","DOI":"10.1007\/s11202-007-0089-y"},{"key":"10_CR21","unstructured":"Odifreddi, P.: Classical recursion theory. Stud. Logic Found. Math. 125 (1992)"},{"key":"10_CR22","unstructured":"Odifreddi, P.: Classical recursion theory. Volume II. Stud. Logic Found. Math. 143 (1999)"},{"key":"10_CR23","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)"},{"key":"10_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2","volume-title":"Higher Recursion Theory","author":"GE Sacks","year":"1990","unstructured":"Sacks, G.E.: Higher Recursion Theory. Springer, Berlin (1990)"},{"issue":"6","key":"10_CR25","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/BF01158034","volume":"44","author":"VL Selivanov","year":"1988","unstructured":"Selivanov, V.L.: Algorithmic complexity of algebraic systems. Math. Notes 44(6), 944\u2013950 (1988). https:\/\/doi.org\/10.1007\/BF01158034","journal-title":"Math. Notes"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1134\/S1995080220020146","volume":"41","author":"VL Selivanov","year":"2020","unstructured":"Selivanov, V.L.: On degree spectra of topological spaces. Lobachevskii J. Math. 41(2), 252\u2013259 (2020). https:\/\/doi.org\/10.1134\/S1995080220020146","journal-title":"Lobachevskii J. Math."},{"key":"10_CR27","unstructured":"Turlington, A.: Computability of Heyting algebras and distributive lattices. Ph.D. thesis, University of Connecticut (2010)"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:28:54Z","timestamp":1784482134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"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":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}