A 1-generic degree which bounds a minimal degree

DOI10.2307/2274661zbMATH Open0712.03034OpenAlexW2107828997WikidataQ56913198 ScholiaQ56913198MaRDI QIDQ3496331FDOQ3496331

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)

Cites Work

• Title not available (Why is that?)

Cited In (10)

• 1-generic splittings of computably enumerable degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Embedding and coding below a 1-generic degree
• Almost weakly 2-generic sets
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• Arithmetical Sacks forcing
• The Information Content of Typical Reals
• Dynamic notions of genericity and array noncomputability
• Multiple genericity: a new transfinite hierarchy of genericity notions
• The Turing degrees below generics and randoms

   Recommendations

• Degrees bounding minimal degrees 👍 👎
• Title not available (Why is that?) 👍 👎
• Minimal degrees recursive in 1-generic degrees 👍 👎
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE 👍 👎
• Genericity and Non-bounding in the Enumeration degrees 👍 👎

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)