Embedding jump upper semilattices into the Turing degrees
From MaRDI portal
Publication:4650267
DOI10.2178/jsl/1058448451zbMath1059.03038OpenAlexW2114190286MaRDI QIDQ4650267
Publication date: 9 February 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1058448451
Decidability of theories and sets of sentences (03B25) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50) Other Turing degree structures (03D28)
Related Items
There is no ordering on the classes in the generalized high/low hierarchies, Degree Structures: Local and Global Investigations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set theory. An introduction to independence proofs
- Computable structures and the hyperarithmetical hierarchy
- Initial segments of the degrees of size \(\aleph _ 1\)
- The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations
- The upper semi-lattice of degrees of recursive unsolvability
- Jump embeddings in the Turing degrees
- Set Theory
- Distributive Initial Segments of the Degrees of Unsolvability
- Recursive Pseudo-Well-Orderings
- On Suborderings of Degrees of Recursive Unsolvability