Generic degrees are complemented
From MaRDI portal
Publication:685063
DOI10.1016/0168-0072(93)90096-VzbMath0788.03061MaRDI QIDQ685063
Publication date: 22 September 1993
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Turing degreedegrees of unsolvability\(n\)- generic setdegrees recursive in \(n\)-generic degreesstrong complementednessupper semilattice of degrees
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal degrees recursive in 1-generic degrees
- On degrees of recursive unsolvability
- Degrees which do not bound minimal degrees
- Definability in the Turing degrees
- The recursively enumerable degrees are dense
- Complementation in the Turing degrees
- The upper semilattice of degrees ≤ 0′ is complemented
- The degrees below a 1-generic degree < 0′
- ∑1-Density and Turing Degrees
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Some applications of the notions of forcing and generic sets
- A theorem on minimal degrees
- Minimal Covers and Arithmetical Sets
- Initial segments of the degrees of unsolvability Part II: minimal degrees
This page was built for publication: Generic degrees are complemented
