Every n-generic degree is a minimal cover of an n-generic degree

DOI10.2307/2275334zbMath0848.03022OpenAlexW2079689563WikidataQ56913205 ScholiaQ56913205MaRDI QIDQ5287689

Masahiro Kumabe

Publication date: 17 August 1993

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

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

zbMATH Keywords

densityminimal coverTuring degreedegrees of unsolvability\(n\)-generic degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

The Information Content of Typical Reals

This page was built for publication: Every n-generic degree is a minimal cover of an n-generic degree