Generic degrees are complemented

DOI10.1016/0168-0072(93)90096-VMaRDI QIDQ685063zbMATH OpenFDO

Authors Masahiro Kumabe

Publication date 22 September 1993

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Turing degreedegrees of unsolvability\(n\)- generic setdegrees recursive in \(n\)-generic degreesstrong complementednessupper semilattice of degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Relative recursive enumerability of generic degrees
• Notions of weak genericity
• Complementation in the Turing degrees
• scientific article; zbMATH DE number 4081537
• Relative definability of \(n\)-generics

Cites work

• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 3916242 (Why is no real title available?)
• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• A theorem on minimal degrees
• Banach–Mazur games, comeager sets and degrees of unsolvability
• Complementation in the Turing degrees
• Definability in the Turing degrees
• Degrees which do not bound minimal degrees
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Minimal Covers and Arithmetical Sets
• Minimal degrees recursive in 1-generic degrees
• On degrees of recursive unsolvability
• Some applications of the notions of forcing and generic sets
• The degrees below a 1-generic degree < 0′
• The recursively enumerable degrees are dense
• The upper semilattice of degrees ≤ 0′ is complemented
• ∑1-Density and Turing Degrees

Cited in

(13)

• The Turing degrees below generics and randoms
• Complementation in the Turing degrees
• Degrees bounding minimal degrees
• The finite intersection principle and genericity
• Minimal upper bounds for arithmetical degrees
• Comparatives Bring a Degree-Based NPI Licenser
• The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals
• Generalized high degrees have the complementation property
• Notions of weak genericity
• scientific article; zbMATH DE number 4081537 (Why is no real title available?)
• The information content of typical reals
• Relative definability of \(n\)-generics
• Degree Monotone Paths

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)