Relative recursive enumerability of generic degrees

DOI10.2307/2275074zbMath0753.03017OpenAlexW4238965282WikidataQ56913202 ScholiaQ56913202MaRDI QIDQ3985104

Masahiro Kumabe

Publication date: 27 June 1992

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

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

zbMATH Keywords

Turing degree\(n\)-generic degreeCohen-generic

Mathematics Subject Classification ID

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

Related Items (5)

Relative enumerability and 1-genericity ⋮ The Information Content of Typical Reals ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ RELATIVE DEFINABILITY OF n-GENERICS ⋮ Bounding non-GL₂ and R.E.A.

This page was built for publication: Relative recursive enumerability of generic degrees