A 1-generic degree which bounds a minimal degree

DOI10.2307/2274661zbMath0712.03034OpenAlexW2107828997WikidataQ56913198 ScholiaQ56913198MaRDI QIDQ3496331

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)

Related Items (10)

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

Cites Work

• Unnamed Item

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