Depth zero Boolean algebras
From MaRDI portal
Recommendations
- Downward closure of depth in countable Boolean algebras
- scientific article; zbMATH DE number 1534579
- Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
- Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
- On Depth and \(\text{Depth}^{+}\) of Boolean algebras
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3308418 (Why is no real title available?)
- scientific article; zbMATH DE number 3406215 (Why is no real title available?)
- A construction for recursive linear orderings
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Alternative characterizations of finitary and well-founded Boolean algebras
- Computable Boolean algebras
- Computable structures and the hyperarithmetical hierarchy
- Every Low 2 Boolean Algebra has a Recursive Copy
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Hierarchies of Boolean algebras
- Recursive and r.e. quotient Boolean algebras
- The completeness of the isomorphism relation for countable Boolean algebras
- The structure of countable Boolean algebras
Cited in
(3)
This page was built for publication: Depth zero Boolean algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581139)