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

DOI10.33048/SEMI.2020.17.067zbMath1437.03128OpenAlexW3116179710MaRDI QIDQ779152

Mikhaĭl G. Peretyat'kin

Publication date: 21 July 2020

Published in: Sibirskie Èlektronnye 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) Logical aspects of Boolean algebras (03G05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong and weak constructivization and computable families
• Constructive models of complete solvable theories
• On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models
• Recursively presentable prime models
• The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models

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