{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T15:24:20Z","timestamp":1766676260211,"version":"3.37.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"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":["Arch. Math. Logic"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00153-024-00927-4","type":"journal-article","created":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T09:02:07Z","timestamp":1717837327000},"page":"67-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Tarski\u2013Lindenbaum algebra of the class of strongly constructivizable models with $$\\omega $$-stable theories"],"prefix":"10.1007","volume":"64","author":[{"given":"Mikhail","family":"Peretyat\u2019kin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,8]]},"reference":[{"key":"927_CR1","doi-asserted-by":"crossref","unstructured":"Ershov, Yu.L., Goncharov, S.S.: Elementary theories and their constructive models. In: Ershov, Yu.L., Goncharov, S.S., Nerode, J.A., Remmel, B. (Eds.), Handbook of Recursive Mathematics. North-Holland Publishing Company, Chapter 2, pp. 115\u2013165 (1998)","DOI":"10.1016\/S0049-237X(98)80003-7"},{"key":"927_CR2","volume-title":"Constructive Models","author":"SS Goncharov","year":"2000","unstructured":"Goncharov, S.S., Ershov, Yu.L.: Constructive Models. Consultants Bureau. XII, New York (2000)"},{"issue":"2","key":"927_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.2307\/2273550","volume":"48","author":"W Hanf","year":"1983","unstructured":"Hanf, W., Myers, D.: Boolean sentence algebras: isomorphism constructions. J. Symb. Logic 48(2), 329\u2013338 (1983)","journal-title":"J. Symb. Logic"},{"key":"927_CR4","doi-asserted-by":"crossref","unstructured":"Harizanov, V.S.: Pure computable model theory. In: Ershov, Yu.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (Eds.), Handbook of Recursive Mathematics. North-Holland Publishing Company, Chapter 1, pp. 1\u2013114 (1998)","DOI":"10.1016\/S0049-237X(98)80002-5"},{"key":"927_CR5","volume-title":"A Shorter Model Theory","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"927_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0219061302000163","volume":"2","author":"S Lempp","year":"2002","unstructured":"Lempp, S., Peretyat\u2019kin, M.G., Solomon, R.: The Lindenbaum algebra of the theory of the class of all finite models. J. Math. Log. 2(2), 145\u2013225 (2002)","journal-title":"J. Math. Log."},{"key":"927_CR7","first-page":"88","volume":"2","author":"MG Peretyat\u2019kin","year":"1982","unstructured":"Peretyat\u2019kin, M.G.: Finitely axiomatizable totally transcendental theories. Trudy of Institute of Mathematics, Siberian Branch of RAN (Russian). Novosibirsk 2, 88\u2013135 (1982)","journal-title":"Novosibirsk"},{"key":"927_CR8","volume-title":"Finitely Axiomatizable Theories","author":"MG Peretyat\u2019kin","year":"1997","unstructured":"Peretyat\u2019kin, M.G.: Finitely Axiomatizable Theories. Plenum, New York (1997)"},{"key":"927_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1090\/conm\/257\/04038","volume":"257","author":"MG Peretyat\u2019kin","year":"2000","unstructured":"Peretyat\u2019kin, M.G.: Finitely axiomatizable theories and Lindenbaum algebras of semantic classes. Contemp. Math. 257, 221\u2013239 (2000)","journal-title":"Contemp. Math."},{"key":"927_CR10","doi-asserted-by":"crossref","unstructured":"Peretyat\u2019kin, M.G.: On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models. In: Proceedings of the Turing Centenary Conference Computability in Europe 2012, Lecture notes in Computer Science, 7318, pp. 589\u2013598. Springer-Verlag, Berlin-Heidelberg (2012)","DOI":"10.1007\/978-3-642-30870-3_59"},{"key":"927_CR11","doi-asserted-by":"crossref","unstructured":"Peretyat\u2019kin, M.G.: The Tarski\u2013Lindenbaum algebra of the class of all strongly constructivizable countable saturated models. In: Proceedings of the Conference Computability in Europe 2013, Lecture notes in Computer Science, volume 7921, pp. 342\u2013352. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39053-1_41"},{"key":"927_CR12","first-page":"913","volume":"17","author":"MG Peretyat\u2019kin","year":"2020","unstructured":"Peretyat\u2019kin, M.G.: The Tarski\u2013Lindenbaum 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":"927_CR13","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)"},{"key":"927_CR14","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-Verlag, Berlin, Heidelberg, New York (1969)","edition":"3"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00927-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-024-00927-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00927-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T15:16:32Z","timestamp":1739373392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-024-00927-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,8]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1007\/s00153-024-00927-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2024,6,8]]},"assertion":[{"value":"17 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}