Generic degrees are complemented
From MaRDI portal
Publication:685063
DOI10.1016/0168-0072(93)90096-VzbMATH Open0788.03061MaRDI QIDQ685063FDOQ685063
Authors: Masahiro Kumabe
Publication date: 22 September 1993
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Recommendations
Turing degreedegrees of unsolvability\(n\)- generic setdegrees recursive in \(n\)-generic degreesstrong complementednessupper semilattice of degrees
Cites Work
- Title not available (Why is that?)
- The recursively enumerable degrees are dense
- The degrees below a 1-generic degree < 0′
- Title not available (Why is that?)
- Some applications of the notions of forcing and generic sets
- Degrees which do not bound minimal degrees
- Title not available (Why is that?)
- On degrees of recursive unsolvability
- ∑1-Density and Turing Degrees
- Definability in the Turing degrees
- Title not available (Why is that?)
- Minimal degrees recursive in 1-generic degrees
- Complementation in the Turing degrees
- The upper semilattice of degrees ≤ 0′ is complemented
- Banach–Mazur games, comeager sets and degrees of unsolvability
- A theorem on minimal degrees
- Minimal Covers and Arithmetical Sets
- Initial segments of the degrees of unsolvability Part II: minimal degrees
Cited In (13)
- Degree Monotone Paths
- Title not available (Why is that?)
- The information content of typical reals
- Minimal upper bounds for arithmetical degrees
- Notions of weak genericity
- Comparatives Bring a Degree-Based NPI Licenser
- The finite intersection principle and genericity
- The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals
- Complementation in the Turing degrees
- Degrees bounding minimal degrees
- Generalized high degrees have the complementation property
- Relative definability of \(n\)-generics
- The Turing degrees below generics and randoms
This page was built for publication: Generic degrees are complemented
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685063)