{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T18:00:11Z","timestamp":1788026411703,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031643088","type":"print"},{"value":"9783031643095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_17","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Universal Boolean Algebras with\u00a0Applications to\u00a0Semantic Classes of\u00a0Models"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Peretyat\u2019kin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Selivanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.2307\/2270692","volume":"35","author":"L Feiner","year":"1970","unstructured":"Feiner, L.: Hierarchies of Boolean algebras. J. Symb. Logic 35(3), 365\u2013373 (1970)","journal-title":"J. Symb. Logic"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02218638","volume":"12","author":"SS Goncharov","year":"1973","unstructured":"Goncharov, S.S.: Constructivizability of superatomic Boolean algebras. Algebra Logic 12(1), 31\u201340 (1973)","journal-title":"Algebra Logic"},{"key":"17_CR3","unstructured":"Goncharov, S.S., Ershov, Y.L.: Constructive Models. Consultants Bureau XII, New York (2000)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0002-9904-1975-13747-5","volume":"31","author":"W Hanf","year":"1975","unstructured":"Hanf, W.: The Boolean algebra of logic. Bull. AMS 31, 587\u2013589 (1975)","journal-title":"Bull. AMS"},{"key":"17_CR5","unstructured":"Harizanov, V.S.: Pure computable model theory, chap. 1. In: Ershov, Yu.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, pp. 1\u2013114. North-Holland Publishing Company (1998)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Hinman, P.G.: Recursion-Theoretic Hierarchies. Cambridge (2017)","DOI":"10.1017\/9781316717110"},{"key":"17_CR7","volume-title":"A Shorter Model Theory","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Odintsov S.P.: Generally constructive Boolean algebras, chap. 20. In: Ershov, Yu.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, pp. 1319\u20131354. North-Holland Publ. Co. (1998)","DOI":"10.1016\/S0049-237X(98)80053-0"},{"issue":"6","key":"17_CR9","first-page":"140","volume":"30","author":"SP Odintsov","year":"1989","unstructured":"Odintsov, S.P., Selivanov, V.L.: Arithmetical hierarchy and ideals of numerated Boolean algebras. Siberian Math. J. 30(6), 140\u2013149 (1989)","journal-title":"Siberian Math. J."},{"issue":"4","key":"17_CR10","first-page":"414","volume":"30","author":"MG Peretyat\u2019kin","year":"1991","unstructured":"Peretyat\u2019kin, M.G.: Semantic universal classes of models. Algebra Logic 30(4), 414\u2013434 (1991)","journal-title":"Algebra Logic"},{"issue":"5","key":"17_CR11","first-page":"517","volume":"30","author":"MG Peretyat\u2019kin","year":"1992","unstructured":"Peretyat\u2019kin, M.G.: Semantic universality of theories over superlist. Algebra Logic 30(5), 517\u2013539 (1992)","journal-title":"Algebra Logic"},{"key":"17_CR12","volume-title":"Finitely Axiomatizable Theories","author":"MG Peretyat\u2019kin","year":"1997","unstructured":"Peretyat\u2019kin, M.G.: Finitely Axiomatizable Theories. Plenum, New York (1997)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Peretyat\u2019kin, M.G.: Constructive models of finitely axiomatizable theories, chap. 9. In: Ershov, Yu.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, pp. 347\u2013379. North-Holland Publ. Co. (1998)","DOI":"10.1016\/S0049-237X(98)80010-4"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-30870-3_59","volume-title":"How the World Computes","author":"MG Peretyat\u2019kin","year":"2012","unstructured":"Peretyat\u2019kin, M.G.: On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 589\u2013598. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30870-3_59"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-39053-1_41","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"MG Peretyat\u2019kin","year":"2013","unstructured":"Peretyat\u2019kin, M.G.: The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 342\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_41"},{"key":"17_CR16","first-page":"913","volume":"17","author":"MG Peretyat\u2019kin","year":"2020","unstructured":"Peretyat\u2019kin, M.G.: The Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models of algorithmic dimension one. Siberian Electron. Math. Rep. 17, 913\u2013922 (2020)","journal-title":"Siberian Electron. Math. Rep."},{"key":"17_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"HJ Rogers","year":"1967","unstructured":"Rogers, H.J.: Theory of Recursive Functions and Effective Computability. Mc. Graw-Hill Book Co., New York (1967)"},{"issue":"6","key":"17_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02018741","volume":"30","author":"VL Selivanov","year":"1991","unstructured":"Selivanov, V.L.: Fine hierarchies and definable index sets. Algebra Logic 30(6), 463\u2013475 (1991)","journal-title":"Algebra Logic"},{"key":"17_CR19","unstructured":"Selivanov, V.L.: Universal Boolean algebras with applications. In: International Conference on Algebra (abstracts), Russia, Barnaul, 20\u201325 August 1991, vol. 127 (1991)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0168-0072(94)00050-6","volume":"78","author":"VL Selivanov","year":"1996","unstructured":"Selivanov, V.L.: On recursively enumerable structures. Ann. Pure Appl. Logic 78, 243\u2013258 (1996)","journal-title":"Ann. Pure Appl. Logic"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Selivanov, V.L.: Fine hierarchy and definability in the Lindenbaum algebra. In: Logic: From Foundations to Applications, Proceedings of the Logic Colloquium 93 in Keele, Oxford, pp. 425\u2013452 (1996)","DOI":"10.1093\/oso\/9780198538622.003.0018"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Selivanov, V.L.: Positive structures. In: Barry Cooper, S., Goncharov, S.S. (eds.) Computability and Models, Perspectives East and West, pp. 321\u2013350. Kluwer Academic\/Plenum Publishers, New York (2003)","DOI":"10.1007\/978-1-4615-0755-0_14"},{"key":"17_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85820-8","volume-title":"Boolean Algebras","author":"R Sikorski","year":"1969","unstructured":"Sikorski, R.: Boolean Algebras, 3rd edn. Springer, New York (1969)","edition":"3"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)","DOI":"10.1007\/978-3-662-02460-7"},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"198","DOI":"10.2307\/2270509","volume":"35","author":"H Tanaka","year":"1970","unstructured":"Tanaka, H.: On analytic well-orderings. J. Symb. Log. 35(2), 198\u2013204 (1970)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:03:31Z","timestamp":1719871411000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","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":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}