THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS

DOI10.1142/S0219061302000163zbMath1033.03035OpenAlexW2012522530MaRDI QIDQ4799377

Steffen Lempp, Mikhaĭl G. Peretyat'kin, D. Reed Solomon

Publication date: 15 May 2003

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219061302000163

zbMATH Keywords

Turing machinesBoolean algebrasfinite modelsfinitely axiomatizable theoriesLindenbaum algebras

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logical aspects of Boolean algebras (03G05) Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

The Boolean Algebra of Piecewise Testable Languages ⋮ Boolean algebras of regular languages

Cites Work

• Strongly constructive models and numerations of the Boolean algebra of recursive sets
• Some properties of the constructivization of Boolean algebras
• Sentences true in all constructive models
• The Boolean algebra of logic

This page was built for publication: THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS