Some properties of the constructivization of Boolean algebras

DOI10.1007/BF00967504zbMath0326.02033OpenAlexW2006883075MaRDI QIDQ1225613

Sergei S. Goncharov

Publication date: 1975

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00967504

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Logical aspects of Boolean algebras (03G05) Computability and recursion theory (03D99) Proof theory and constructive mathematics (03F99)

Related Items

THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS ⋮ The minimality of certain decidability conditions for Boolean algebras ⋮ Categoricity for primitive recursive and polynomial Boolean algebras ⋮ Polynomial-time versus recursive models ⋮ Recursive Linear Orders with Incomplete Successivities ⋮ The existence of strongly computable representations in the class of Boolean algebras ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Enumerations of simple models ⋮ Recursive linear orders with recursive successivities

Cites Work

• Unnamed Item
• Hierarchies of Boolean algebras