Relative enumerability and 1-genericity

DOI10.2178/jsl/1309952526zbMath1260.03079OpenAlexW2107278900MaRDI QIDQ3173532

Wei Wang

Publication date: 10 October 2011

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

Full work available at URL: https://doi.org/10.2178/jsl/1309952526

zbMATH Keywords

Turing degrees1-genericrelative enumerability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (2)

Domination, forcing, array nonrecursiveness and relative recursive enumerability ⋮ Measure-theoretic applications of higher Demuth’s Theorem

Cites Work

• Lowness for genericity
• The continuity of cupping to \(\text \textbf{0}'\)
• Relative recursive enumerability of generic degrees

This page was built for publication: Relative enumerability and 1-genericity