Decidable Boolean algebras of low level
From MaRDI portal
Publication:1295398
DOI10.1016/S0168-0072(97)00068-7zbMath0938.03059OpenAlexW2058511598MaRDI QIDQ1295398
Publication date: 14 June 2000
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00068-7
Decidability of theories and sets of sentences (03B25) Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arithmetic hierarchy and ideals of enumerated Boolean algebras
- Model theory.
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
- Recursive isomorphism types of recursive Boolean algebras
- Recursive Boolean algebras with recursive atoms
- Every Low Boolean Algebra is Isomorphic to a Recursive One