On computability-theoretic universality of Boolean-valued models

DOI10.1016/J.JCSS.2026.103821MaRDI QIDQ7307949zbMATH OpenFDO

Authors Nikolay Bazhenov, Mustafa Manat

Publication date 3 August 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2026.103821

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A computable functor from graphs to fields
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• A note on hereditarily Π10- and Σ10-complete sets of sentences
• A proof of the independence of the continuum hypothesis
• Autostability of models
• Categoricity spectra of computable structures
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Computability theoretic classifications for classes of structures
• Computable contact algebras
• Computable functors and effective interpretability
• Computable Heyting algebras with distinguished atoms and coatoms
• Computable Structure Theory
• Computable structure theory. A unified approach
• Computable structures and the hyperarithmetical hierarchy
• Computably categorical structures and expansions by constants
• CONSTRUCTIVE ALGEBRAS I
• Decidable models
• Definability and decision problems in arithmetic
• Degree spectra and computable dimensions in algebraic structures
• Degree spectra of structures
• Degrees coded in jumps of orderings
• Degrees of categoricity of computable structures
• Degrees of Structures
• Elements of finite model theory.
• Enumerations in computable structure theory
• scientific article; zbMATH DE number 2184445 (Why is no real title available?)
• scientific article; zbMATH DE number 1002913 (Why is no real title available?)
• scientific article; zbMATH DE number 1374860 (Why is no real title available?)
• scientific article; zbMATH DE number 3779289 (Why is no real title available?)
• scientific article; zbMATH DE number 42239 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3458610 (Why is no real title available?)
• scientific article; zbMATH DE number 1302870 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3259044 (Why is no real title available?)
• scientific article; zbMATH DE number 3411031 (Why is no real title available?)
• On a computability-theoretic approach to Boolean-valued models
• On the effective universality of mereological theories
• Problem of the number of non-self-equivalent constructivizations
• Recursive isomorphism types of recursive Boolean algebras
• Solvable cases of the decision problem
• Strong and weak constructivization and computable families
• Turing computable embeddings
• Turing's legacy. Developments from Turing's ideas in logic
• Undecidable fragments of elementary theories
• Über Möglichkeiten im Relativkalkül.

This page was built for publication: On computability-theoretic universality of Boolean-valued models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307949)