Every Low Boolean Algebra is Isomorphic to a Recursive One
From MaRDI portal
Publication:4318310
DOI10.2307/2160766zbMath0820.03019OpenAlexW4242595449MaRDI QIDQ4318310
Carl G. jun. Jockusch, Rodney G. Downey
Publication date: 2 January 1995
Full work available at URL: https://doi.org/10.2307/2160766
atomless Boolean algebracountable Boolean algebrarecursive Boolean algebralow setseffective presentationlow filters
Boolean algebras (Boolean rings) (06E99) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)
Related Items
New degree spectra of Polish spaces, Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders, Boolean algebra approximations, Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders, Rice sequences of relations, Linear orderings of low degree, COPYING ONE OF A PAIR OF STRUCTURES, A class of low linear orders having computable presentations, Computable Stone spaces, THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES, On the triple jump of the set of atoms of a Boolean algebra, COMPUTABLY COMPACT METRIC SPACES, Computability on linear orderings enriched with predicates, Some Questions in Computable Mathematics, Cuts of linear orders, On strongly jump traceable reals, Degree spectra of real closed fields, On a computable presentation of low linear orderings, A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS, Notes on the Jump of a Structure, TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS, Depth zero Boolean algebras, Every recursive Boolean algebra is isomorphic to one with incomplete atoms, Coding and definability in computable structures, Computable linear orders and limitwise monotonic functions, 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, Decidable Boolean algebras of low level, COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM, Computable linear orders and the ershov hierarchy, Limitwise monotonic spectra and their generalizations
Cites Work
- Degrees of orderings not isomorphic to recursive linear orderings
- Stability of recursive structures in arithmetical degrees
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Path integral quantisation of the open strings normal modes
- Recursive isomorphism types of recursive Boolean algebras
- Recursive Boolean algebras with recursive atoms
- Jumps of Orderings
- A metatheorem for constructions by finitely many workers
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Degrees coded in jumps of orderings
- Recursive Linear Orders with Incomplete Successivities
- Orderings with αth Jump Degree 0 (α)
- Boolean algebras, Stone spaces, and the iterated Turing jump
- Degrees of Structures
- Every Low 2 Boolean Algebra has a Recursive Copy
- Hierarchies of Boolean algebras
- The strong homogeneity conjecture
- Degrees of Nonrecursive Presentability
- Unnamed Item
- Unnamed Item
- Unnamed Item
