Every Low 2 Boolean Algebra has a Recursive Copy

DOI10.2307/2161917MaRDI QIDQ4874286zbMATH OpenOpenAlexFDO

Authors J. Thurber

Publication date 1 July 1996

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2161917

zbMATH Keywords

Boolean algebradegree of a structureopen diagramrecursive Boolean algebraTuring degree

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25)

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

(23)

• Coding and definability in computable structures
• Degree spectra of structures
• Computable presentability of countable linear orders
• Computable linear orders and the ershov hierarchy
• Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
• Codings on linear orders and algorithmic independence of natural relations
• Rice sequences of relations
• Initial segments of computable linear orders with computable natural relations
• On the n-back-and-forth types of Boolean algebras
• Boolean algebra approximations
• On the triple jump of the set of atoms of a Boolean algebra
• Notes on the Jump of a Structure
• Depth zero Boolean algebras
• Computability on linear orderings enriched with predicates
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Copyable structures
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• Cuts of linear orders
• On a computable presentation of low linear orderings
• The coding theorems for linear orders
• Optimal syntactic definitions of back-and-forth types
• Computably categorical Boolean algebras enriched by ideals and atoms

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)