Every Low 2 Boolean Algebra has a Recursive Copy
From MaRDI portal
Publication:4874286
Recommendations
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- scientific article; zbMATH DE number 3900736
- Universal recursively enumerable Boolean algebras
- Recursive Boolean algebras with recursive atoms
- Recursive homogeneous Boolean algebras
- Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra
- On Boolean Algebras and their Recursive Completions
- Recursive and r.e. quotient Boolean algebras
- Decidable Boolean algebras of low level
Cited in
(21)- Degree spectra of structures
- Copyable structures
- Coding and definability in computable structures
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Notes on the Jump of a Structure
- Computably categorical Boolean algebras enriched by ideals and atoms
- Boolean algebra approximations
- On a computable presentation of low linear orderings
- Computability on linear orderings enriched with predicates
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Initial segments of computable linear orders with computable natural relations
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Boolean algebras, Stone spaces, and the iterated Turing jump
- Depth zero Boolean algebras
- Codings on linear orders and algorithmic independence of natural relations
- Computable presentability of countable linear orders
- Rice sequences of relations
- Cuts of linear orders
- On the $n$-back-and-forth types of Boolean algebras
- On the triple jump of the set of atoms of a Boolean algebra
- Computable linear orders and the ershov hierarchy
This page was built for publication: Every Low 2 Boolean Algebra has a Recursive Copy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4874286)
