{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T14:01:29Z","timestamp":1784815289025,"version":"3.55.0"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004561","name":"Ministry of Science and Higher Education of the Republic of Kazakhstan","doi-asserted-by":"publisher","award":["AP26198617"],"award-info":[{"award-number":["AP26198617"]}],"id":[{"id":"10.13039\/501100004561","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012190","name":"FSBSI Directorate of State Scientific and Technical Programs","doi-asserted-by":"publisher","award":["075-15-2025-349"],"award-info":[{"award-number":["075-15-2025-349"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012632","name":"Nazarbayev University","doi-asserted-by":"publisher","award":["201223FD8823"],"award-info":[{"award-number":["201223FD8823"]}],"id":[{"id":"10.13039\/501100012632","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jcss.2026.103821","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T15:45:26Z","timestamp":1780415126000},"page":"103821","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On computability-theoretic universality of Boolean-valued models"],"prefix":"10.1016","volume":"161","author":[{"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103821_br0010","series-title":"Solvable Cases of the Decision Problem","author":"Ackermann","year":"1954"},{"key":"10.1016\/j.jcss.2026.103821_br0020","article-title":"Computable Structures and the Hyperarithmetical Hierarchy","volume":"vol. 144","author":"Ash","year":"2000"},{"issue":"4","key":"10.1016\/j.jcss.2026.103821_br0030","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-2019-1817","article-title":"Computable contact algebras","volume":"167","author":"Bazhenov","year":"2019","journal-title":"Fundam. Inform."},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0040","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s10958-021-05419-x","article-title":"Categoricity spectra of computable structures","volume":"256","author":"Bazhenov","year":"2021","journal-title":"J. Math. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0050","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10849-022-09371-0","article-title":"Computable Heyting algebras with distinguished atoms and coatoms","volume":"32","author":"Bazhenov","year":"2023","journal-title":"J. Log. Lang. Inf."},{"key":"10.1016\/j.jcss.2026.103821_br0060","series-title":"Set Theory: Boolean-Valued Models and Independence Proofs","author":"Bell","year":"2005"},{"key":"10.1016\/j.jcss.2026.103821_br0070","series-title":"Theory and Applications of Models of Computation - 19th Annual Conference, TAMC 2025","first-page":"79","article-title":"On a computability-theoretic approach to Boolean-valued models","volume":"vol. 16084","author":"Bazhenov","year":"2026"},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0080","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/malq.202100016","article-title":"On the effective universality of mereological theories","volume":"68","author":"Bazhenov","year":"2022","journal-title":"Math. Log. Q."},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0090","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2586747","article-title":"Computably categorical structures and expansions by constants","volume":"64","author":"Cholak","year":"1999","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jcss.2026.103821_br0100","series-title":"Computable Structure Theory: A Unified Approach","author":"Downey","year":"2026"},{"key":"10.1016\/j.jcss.2026.103821_br0110","series-title":"Constructive Models","author":"Ershov","year":"2000"},{"key":"10.1016\/j.jcss.2026.103821_br0120","series-title":"Selected Questions of Algebra and Logic","first-page":"111","article-title":"Constructive models","author":"Ershov","year":"1973"},{"key":"10.1016\/j.jcss.2026.103821_br0130","series-title":"Decidability Problems and Constructive Models","author":"Ershov","year":"1980"},{"key":"10.1016\/j.jcss.2026.103821_br0140","series-title":"Turing's Legacy: Developments from Turing's Ideas in Logic","first-page":"124","article-title":"Computable model theory","volume":"vol. 42","author":"Fokina","year":"2014"},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0150","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00153-009-0160-4","article-title":"Degrees of categoricity of computable structures","volume":"49","author":"Fokina","year":"2010","journal-title":"Arch. Math. Log."},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0160","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01669102","article-title":"Autostability of models","volume":"19","author":"Goncharov","year":"1980","journal-title":"Algebra Log."},{"issue":"3","key":"10.1016\/j.jcss.2026.103821_br0170","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.apal.2005.02.001","article-title":"Enumerations in computable structure theory","volume":"136","author":"Goncharov","year":"2005","journal-title":"Ann. Pure Appl. Log."},{"issue":"6","key":"10.1016\/j.jcss.2026.103821_br0180","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF01669323","article-title":"Problem of the number of non-self-equivalent constructivizations","volume":"19","author":"Goncharov","year":"1980","journal-title":"Algebra Log."},{"key":"10.1016\/j.jcss.2026.103821_br0190","series-title":"Countable Boolean Algebras and Decidability","author":"Goncharov","year":"1997"},{"key":"10.1016\/j.jcss.2026.103821_br0200","series-title":"Handbook of Recursive Mathematics","first-page":"3","article-title":"Pure computable model theory","volume":"vol. 138","author":"Harizanov","year":"1998"},{"issue":"4","key":"10.1016\/j.jcss.2026.103821_br0210","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.2178\/jsl\/1067620182","article-title":"A computably categorical structure whose expansion by a constant has infinite computable dimension","volume":"68","author":"Hirschfeldt","year":"2003","journal-title":"J. Symb. Log."},{"issue":"1\u20133","key":"10.1016\/j.jcss.2026.103821_br0220","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0168-0072(01)00087-2","article-title":"Degree spectra and computable dimensions in algebraic structures","volume":"115","author":"Hirschfeldt","year":"2002","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1016\/j.jcss.2026.103821_br0230","article-title":"Model Theory","volume":"vol. 42","author":"Hodges","year":"1993"},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0240","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1017\/jsl.2016.12","article-title":"Computable functors and effective interpretability","volume":"82","author":"Harrison-Trainor","year":"2017","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jcss.2026.103821_br0250","series-title":"Boolean Valued Analysis","author":"Kusraev","year":"1999"},{"issue":"3","key":"10.1016\/j.jcss.2026.103821_br0260","doi-asserted-by":"crossref","first-page":"901","DOI":"10.2178\/jsl\/1191333847","article-title":"Turing computable embeddings","volume":"72","author":"Knight","year":"2007","journal-title":"J. Symb. Log."},{"issue":"4","key":"10.1016\/j.jcss.2026.103821_br0270","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.2307\/2273915","article-title":"Degrees coded in jumps of orderings","volume":"51","author":"Knight","year":"1986","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jcss.2026.103821_br0280","series-title":"Handbook of Boolean Algebras, vol. 1","author":"Koppelberg","year":"1989"},{"issue":"2","key":"10.1016\/j.jcss.2026.103821_br0290","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10958-021-05424-0","article-title":"Degree spectra of structures","volume":"256","author":"Kalimullin","year":"2021","journal-title":"J. Math. Sci."},{"key":"10.1016\/j.jcss.2026.103821_br0300","series-title":"Elements of Finite Model Theory","author":"Libkin","year":"2004"},{"key":"10.1016\/j.jcss.2026.103821_br0310","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01458217","article-title":"\u00dcber M\u00f6glichkeiten im Relativkalk\u00fcl","volume":"76","author":"L\u00f6wenheim","year":"1915","journal-title":"Math. Ann."},{"issue":"3","key":"10.1016\/j.jcss.2026.103821_br0320","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","article-title":"Constructive algebras. I","volume":"16","author":"Mal'tsev","year":"1961","journal-title":"Russ. Math. Surv."},{"key":"10.1016\/j.jcss.2026.103821_br0330","series-title":"Proceedings of ICM 2014. Vol. II","first-page":"79","article-title":"Computability theoretic classifications for classes of structures","author":"Montalb\u00e1n","year":"2014"},{"key":"10.1016\/j.jcss.2026.103821_br0340","series-title":"Computable Structure Theory: Within the Arithmetic","author":"Montalb\u00e1n","year":"2021"},{"issue":"3\u20134","key":"10.1016\/j.jcss.2026.103821_br0350","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02757002","article-title":"Decidable models","volume":"25","author":"Morley","year":"1976","journal-title":"Isr. J. Math."},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0360","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1017\/jsl.2017.50","article-title":"A computable functor from graphs to fields","volume":"83","author":"Miller","year":"2018","journal-title":"J. Symb. Log."},{"issue":"1","key":"10.1016\/j.jcss.2026.103821_br0370","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BF01190967","article-title":"Undecidable fragments of elementary theories","volume":"35","author":"Nies","year":"1996","journal-title":"Algebra Univers."},{"issue":"3","key":"10.1016\/j.jcss.2026.103821_br0380","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01463352","article-title":"Strong and weak constructivization and computable families","volume":"13","author":"Nurtazin","year":"1974","journal-title":"Algebra Log."},{"key":"10.1016\/j.jcss.2026.103821_br0390","article-title":"Classical Recursion Theory","volume":"vol. 125","author":"Odifreddi","year":"1992"},{"issue":"3","key":"10.1016\/j.jcss.2026.103821_br0400","doi-asserted-by":"crossref","first-page":"572","DOI":"10.2307\/2273757","article-title":"Recursive isomorphism types of recursive Boolean algebras","volume":"46","author":"Remmel","year":"1981","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jcss.2026.103821_br0410","series-title":"Degrees of unsolvability of models","author":"Richter","year":"1977"},{"issue":"4","key":"10.1016\/j.jcss.2026.103821_br0420","doi-asserted-by":"crossref","first-page":"723","DOI":"10.2307\/2273222","article-title":"Degrees of structures","volume":"46","author":"Richter","year":"1981","journal-title":"J. Symb. Log."},{"issue":"2","key":"10.1016\/j.jcss.2026.103821_br0430","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2307\/2266510","article-title":"Definability and decision problems in arithmetic","volume":"14","author":"Robinson","year":"1949","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jcss.2026.103821_br0440","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01705520","article-title":"A proof of the independence of the continuum hypothesis","volume":"1","author":"Scott","year":"1967","journal-title":"Math. Syst. Theory"},{"issue":"5","key":"10.1016\/j.jcss.2026.103821_br0450","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1093\/logcom\/exu066","article-title":"A note on hereditarily \u03a010- and \u03a310-complete sets of sentences","volume":"26","author":"Speranski","year":"2016","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.jcss.2026.103821_br0460","series-title":"Axiomatic Set Theory","author":"Takeuti","year":"1973"},{"key":"10.1016\/j.jcss.2026.103821_br0470","first-page":"145","article-title":"General theory of \u2207-models","volume":"8","author":"Vop\u011bnka","year":"1967","journal-title":"Comment. Math. Univ. Carol."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200002600067X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200002600067X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T13:13:57Z","timestamp":1784812437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200002600067X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":47,"alternative-id":["S002200002600067X"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103821","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On computability-theoretic universality of Boolean-valued models","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103821","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103821"}}