A 1-generic degree which bounds a minimal degree

DOI10.2307/2274661MaRDI QIDQ3496331zbMATH OpenOpenAlexWikidataFDO

Authors Masahiro Kumabe

Publication date 1990

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274661

zbMATH Keywords

1-generic degree bounding a minimal degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Degrees bounding minimal degrees
• scientific article; zbMATH DE number 3916242
• Minimal degrees recursive in 1-generic degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Genericity and Non-bounding in the Enumeration degrees

Cited in

(16)

• Embedding and coding below a 1-generic degree
• The Turing degrees below generics and randoms
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• 1-generic splittings of computably enumerable degrees
• Degrees bounding minimal degrees
• Multiple genericity: a new transfinite hierarchy of genericity notions
• scientific article; zbMATH DE number 3916242 (Why is no real title available?)
• scientific article; zbMATH DE number 4041900 (Why is no real title available?)
• Density-1-bounding and quasiminimality in the generic degrees
• Minimal degrees recursive in 1-generic degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Dynamic notions of genericity and array noncomputability
• Theory and Applications of Models of Computation
• Arithmetical Sacks forcing
• The information content of typical reals
• Almost weakly 2-generic sets

This page was built for publication: A 1-generic degree which bounds a minimal degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496331)