The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models

DOI10.1007/978-3-642-39053-1_41zbMath1433.03086OpenAlexW116072411MaRDI QIDQ5326382

Mikhaĭl G. Peretyat'kin

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_41

zbMATH Keywords

hierarchyTuring computabilityc.e. Boolean algebrafinitely axiomatizable theoryTarski-Lindenbaum algebram-complete setcountable saturated modelcomputable family of types

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Logical aspects of Boolean algebras (03G05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)

Related Items (2)

A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic ⋮ The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one

This page was built for publication: The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models