Every Low 2 Boolean Algebra has a Recursive Copy
From MaRDI portal
Publication:4874286
DOI10.2307/2161917zbMath0840.03024OpenAlexW1990990734MaRDI QIDQ4874286
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
Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57)
Related Items
Initial segments of computable linear orders with computable natural relations ⋮ Boolean algebra approximations ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Rice sequences of relations ⋮ On the triple jump of the set of atoms of a Boolean algebra ⋮ Computability on linear orderings enriched with predicates ⋮ Cuts of linear orders ⋮ On a computable presentation of low linear orderings ⋮ Notes on the Jump of a Structure ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ Depth zero Boolean algebras ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ Coding and definability in computable structures ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ Computably categorical Boolean algebras enriched by ideals and atoms ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Computable linear orders and the ershov hierarchy
