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

DOI10.33048/SEMI.2020.17.067zbMATH Open1437.03128OpenAlexW3116179710MaRDI QIDQ779152FDOQ779152

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models
• Title not available (Why is that?)
• Strong and weak constructivization and computable families
• Recursively presentable prime models
• On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models
• Constructive models of complete solvable theories
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• 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)