Depth zero Boolean algebras
From MaRDI portal
Publication:3581139
DOI10.1090/S0002-9947-10-05002-6zbMath1203.03057MaRDI QIDQ3581139
Publication date: 16 August 2010
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structure of countable Boolean algebras
- Alternative characterizations of finitary and well-founded Boolean algebras
- Recursive and r.e. quotient Boolean algebras
- Computable structures and the hyperarithmetical hierarchy
- Computable Boolean algebras
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- A construction for recursive linear orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- The completeness of the isomorphism relation for countable Boolean algebras
- Every Low 2 Boolean Algebra has a Recursive Copy
- Hierarchies of Boolean algebras
This page was built for publication: Depth zero Boolean algebras