Every Low Boolean Algebra is Isomorphic to a Recursive One
From MaRDI portal
Recommendations
Cites work
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- A metatheorem for constructions by finitely many workers
- Boolean algebras, Stone spaces, and the iterated Turing jump
- Degrees coded in jumps of orderings
- Degrees of Nonrecursive Presentability
- Degrees of orderings not isomorphic to recursive linear orderings
- Degrees of Structures
- Every Low 2 Boolean Algebra has a Recursive Copy
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Hierarchies of Boolean algebras
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 3224578 (Why is no real title available?)
- Jumps of Orderings
- Orderings with αth Jump Degree 0 (α)
- Path integral quantisation of the open strings normal modes
- Recursive Boolean algebras with recursive atoms
- Recursive isomorphism types of recursive Boolean algebras
- Recursive Linear Orders with Incomplete Successivities
- Stability of recursive structures in arithmetical degrees
- The strong homogeneity conjecture
Cited in
(39)- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Decidable Boolean algebras of low level
- Degree spectra of real closed fields
- Coding and definability in computable structures
- Computable linear orders and limitwise monotonic functions
- Degree spectra of structures
- Computable presentability of countable linear orders
- Computable linear orders and the ershov hierarchy
- Limitwise monotonic spectra and their generalizations
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Computable Boolean algebras
- Rice sequences of relations
- Some Questions in Computable Mathematics
- 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
- scientific article; zbMATH DE number 4035813 (Why is no real title available?)
- Computability on linear orderings enriched with predicates
- A computable functor from graphs to fields
- Every Low 2 Boolean Algebra has a Recursive Copy
- COPYING ONE OF A PAIR OF STRUCTURES
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Computability of Polish spaces up to homeomorphism
- A class of low linear orders having computable presentations
- Linear orderings of low degree
- Computable Stone spaces
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
- COMPUTABLY COMPACT METRIC SPACES
- Cuts of linear orders
- Every \(\Delta^0_2\) Polish space is computable topological
- On a computable presentation of low linear orderings
- The coding theorems for linear orders
- Title not available (Why is no real title available?)
- Computably categorical Boolean algebras enriched by ideals and atoms
- New degree spectra of Polish spaces
- On strongly jump traceable reals
This page was built for publication: Every Low Boolean Algebra is Isomorphic to a Recursive One
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318310)
