The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one

DOI10.33048/SEMI.2020.17.067MaRDI QIDQ779152zbMATH OpenOpenAlexFDO

Authors Mikhaĭl G. Peretyat'kin

Publication date 21 July 2020

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/semi.2020.17.067

zbMATH Keywords

first-order logicTarski-Lindenbaum algebracomputable isomorphismalgorithmic complexity estimatesemantic class of models

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Logical aspects of Boolean algebras (03G05)

Recommendations

• On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models
• The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
• THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• The index set of Boolean algebras autostable relative to strong constructivizations

Cites work

• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 1081433 (Why is no real title available?)
• scientific article; zbMATH DE number 1531932 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Constructive models of complete solvable theories
• On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models
• Recursively presentable prime models
• Strong and weak constructivization and computable families
• The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models

Cited in

(4)

• The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
• scientific article; zbMATH DE number 1531932 (Why is no real title available?)
• On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models
• THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS

This page was built for publication: The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one

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