{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:40:08Z","timestamp":1767318008123,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_7","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:36:33Z","timestamp":1767317793000},"page":"79-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a\u00a0Computability-Theoretic Approach to\u00a0Boolean-Valued Models"],"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-0002-8259-4441","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"7_CR1","volume-title":"Solvable Cases of the Decision Problem","author":"W Ackermann","year":"1954","unstructured":"Ackermann, W.: Solvable Cases of the Decision Problem. North-Holland, Amsterdam (1954)"},{"key":"7_CR2","unstructured":"Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol.\u00a0144. Elsevier, Amsterdam (2000)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s10958-021-05419-x","volume":"256","author":"NA Bazhenov","year":"2021","unstructured":"Bazhenov, N.A.: Categoricity spectra of computable structures. J. Math. Sci. 256(1), 34\u201350 (2021). https:\/\/doi.org\/10.1007\/s10958-021-05419-x","journal-title":"J. Math. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568520.001.0001","volume-title":"Set Theory: Boolean-Valued Models and Independence Proofs","author":"JL Bell","year":"2005","unstructured":"Bell, J.L.: Set Theory: Boolean-Valued Models and Independence Proofs, 3rd edn. Oxford University Press, Oxford (2005)","edition":"3"},{"key":"7_CR5","unstructured":"Downey, R., Melnikov, A.: Computable Structure Theory: A Unified Approach. https:\/\/homepages.ecs.vuw.ac.nz\/~melnikal\/maindoc.pdf, to appear"},{"key":"7_CR6","unstructured":"Ershov, Y.L.: Constructive models. In: Selected Questions of Algebra and Logic, pp. 111\u2013130. Nauka, Novosibirsk (1973). (in Russian)"},{"key":"7_CR7","volume-title":"Decidability Problems and Constructive Models","author":"YL Ershov","year":"1980","unstructured":"Ershov, Y.L.: Decidability Problems and Constructive Models. Nauka, Moscow (1980). in Russian"},{"key":"7_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, New York (2000)"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01669323","volume":"19","author":"SS Goncharov","year":"1980","unstructured":"Goncharov, S.S.: Problem of the number of non-self-equivalent constructivizations. Algebra Log. 19(6), 401\u2013414 (1980). https:\/\/doi.org\/10.1007\/BF01669323","journal-title":"Algebra Log."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01669102","volume":"19","author":"SS Goncharov","year":"1980","unstructured":"Goncharov, S.S., Dzgoev, V.D.: Autostability of models. Algebra Log. 19(1), 28\u201337 (1980). https:\/\/doi.org\/10.1007\/BF01669102","journal-title":"Algebra Log."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Harizanov, V.S.: Pure computable model theory. In: Handbook of Recursive Mathematics, vol.\u00a01, Studies in Logic and the Foundations of Mathematics, vol.\u00a0138, pp. 3\u2013114. Elsevier, Amsterdam (1998). https:\/\/doi.org\/10.1016\/S0049-237X(98)80002-5","DOI":"10.1016\/S0049-237X(98)80002-5"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/jsl.2016.12","volume":"82","author":"M Harrison-Trainor","year":"2017","unstructured":"Harrison-Trainor, M., Melnikov, A., Miller, R., Montalb\u00e1n, A.: Computable functors and effective interpretability. J. Symb. Log. 82(1), 77\u201397 (2017). https:\/\/doi.org\/10.1017\/jsl.2016.12","journal-title":"J. Symb. Log."},{"issue":"1\u20133","key":"7_CR13","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"},{"key":"7_CR14","volume-title":"Handbook of Boolean Algebras","author":"S Koppelberg","year":"1989","unstructured":"Koppelberg, S.: Handbook of Boolean Algebras, vol. 1. North-Holland, Amsterdam (1989)"},{"key":"7_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-4443-8","volume-title":"Boolean Valued Analysis","author":"AG Kusraev","year":"1999","unstructured":"Kusraev, A.G., Kutateladze, S.S.: Boolean Valued Analysis. Kluwer Academic, New York (1999)"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"L\u00f6wenheim, L.: \u00dcber M\u00f6glichkeiten im Relativkalk\u00fcl. Math. Ann. 76, 447\u2013470 (1915). https:\/\/doi.org\/10.1007\/BF01458217","DOI":"10.1007\/BF01458217"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","volume":"16","author":"AI Mal\u2019tsev","year":"1961","unstructured":"Mal\u2019tsev, A.I.: Constructive algebras. I. Russ. Math. Surv. 16(3), 77\u2013129 (1961). https:\/\/doi.org\/10.1070\/RM1961v016n03ABEH001120","journal-title":"Russ. Math. Surv."},{"issue":"3\u20134","key":"7_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02757002","volume":"25","author":"M Morley","year":"1976","unstructured":"Morley, M.: Decidable models. Isr. J. Math. 25(3\u20134), 233\u2013240 (1976). https:\/\/doi.org\/10.1007\/BF02757002","journal-title":"Isr. J. Math."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01463352","volume":"13","author":"AT Nurtazin","year":"1974","unstructured":"Nurtazin, A.T.: Strong and weak constructivization and computable families. Algebra Log. 13(3), 177\u2013184 (1974). https:\/\/doi.org\/10.1007\/BF01463352","journal-title":"Algebra Log."},{"key":"7_CR20","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0125. Elsevier, Amsterdam (1992)"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Pal\u2019chunov, D.E., Yakhyaeva, G.E.: Interval fuzzy algebraic systems. In: Mathematical logic in Asia, pp. 191\u2013202. World Scientific Publishing, Hackensack (2006). https:\/\/doi.org\/10.1142\/9789812772749_0014","DOI":"10.1142\/9789812772749_0014"},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"572","DOI":"10.2307\/2273757","volume":"46","author":"JB Remmel","year":"1981","unstructured":"Remmel, J.B.: Recursive isomorphism types of recursive Boolean algebras. J. Symb. Log. 46(3), 572\u2013594 (1981). https:\/\/doi.org\/10.2307\/2273757","journal-title":"J. Symb. Log."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01705520","volume":"1","author":"D Scott","year":"1967","unstructured":"Scott, D.: A proof of the independence of the continuum hypothesis. Math. Syst. Theory 1, 89\u2013111 (1967). https:\/\/doi.org\/10.1007\/BF01705520","journal-title":"Math. Syst. Theory"},{"key":"7_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-8751-0","volume-title":"Axiomatic Set Theory","author":"G Takeuti","year":"1973","unstructured":"Takeuti, G., Zaring, W.M.: Axiomatic Set Theory. Springer, New York (1973)"},{"key":"7_CR25","unstructured":"Vop\u011bnka, P.: General theory of $$\\nabla $$-models. Comment. Math. Univ. Carolinae 8, 145\u2013170 (1967). http:\/\/eudml.org\/doc\/16203"}],"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-981-95-4839-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:36:35Z","timestamp":1767317795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 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","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}