Every recursive Boolean algebra is isomorphic to one with incomplete atoms

DOI10.1016/0168-0072(93)90075-OzbMath0796.03049MaRDI QIDQ1210349

Rodney G. Downey

Publication date: 11 August 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

recursive Boolean algebradegrees of undecidabilityTuring incomplete

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45)

Related Items (8)

Degrees of orders on torsion-free abelian groups ⋮ On the triple jump of the set of atoms of a Boolean algebra ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Degree spectra of the successor relation of computable linear orderings ⋮ Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ On computable self-embeddings of computable linear orderings ⋮ Decidable Boolean algebras of low level

Cites Work

• Degrees of orderings not isomorphic to recursive linear orderings
• Recursive isomorphism types of recursive Boolean algebras
• Recursive Boolean algebras with recursive atoms
• Recursive Linear Orders with Incomplete Successivities
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Hierarchies of Boolean algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every recursive Boolean algebra is isomorphic to one with incomplete atoms