Degrees which do not bound minimal degrees
From MaRDI portal
Publication:1073789
DOI10.1016/0168-0072(86)90022-9zbMath0589.03027OpenAlexW2043719938MaRDI QIDQ1073789
Publication date: 1986
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(86)90022-9
Related Items (7)
There is no ordering on the classes in the generalized high/low hierarchies ⋮ Bounding minimal degrees by computably enumerable degrees ⋮ \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees ⋮ 2-minimality, jump classes and a note on natural definability ⋮ Generic degrees are complemented ⋮ Degrees bounding minimal degrees ⋮ Decidability and Invariant Classes for Degree Structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal degrees and the jump operator
- A minimal degree not realizing least possible jump
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Simple Proofs of Some Theorems on High Degrees of Unsolvability
- Double jumps of minimal degrees
- Degrees of Unsolvability
This page was built for publication: Degrees which do not bound minimal degrees