Independence Results on the Global Structure of the Turing Degrees
From MaRDI portal
Publication:3309826
DOI10.2307/1999225zbMath0528.03027OpenAlexW4238429729WikidataQ56390923 ScholiaQ56390923MaRDI QIDQ3309826
Theodore A. Slaman, Marcia J. Groszek
Publication date: 1983
Full work available at URL: https://doi.org/10.2307/1999225
Consistency and independence results (03E35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Dominating the Erdős-Moser theorem in reverse mathematics ⋮ Separating families and order dimension of Turing degrees ⋮ Martin's axiom and embeddings of upper semi-lattices into the Turing degrees ⋮ Intervals of the Muchnik lattice ⋮ Initial segments of the degrees of size \(\aleph _ 1\) ⋮ Hyperhypersimple sets and \(\Delta _ 2\) systems ⋮ \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\)
Cites Work
- Initial segments of the degrees of unsolvability
- The upper semi-lattice of degrees of recursive unsolvability
- Iterated perfect-set forcing
- Countable initial segments of the degrees of unsolvability
- Degrees of Unsolvability. (AM-55)
- Distributive Initial Segments of the Degrees of Unsolvability
- Unnamed Item