Relative enumerability and 1-genericity

DOI10.2178/JSL/1309952526zbMATH Open1260.03079OpenAlexW2107278900MaRDI QIDQ3173532FDOQ3173532

Wei Wang

Publication date: 10 October 2011

Published in: 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)

Cites Work

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

Cited In (5)

• Measure-theoretic applications of higher Demuth's theorem
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Relative enumerability in the difference hierarchy
• Genericity and Non-bounding in the Enumeration degrees
• Every 1-generic computes a properly 1-generic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173532)