Bounding non-GL2 and R.E.A.

DOI10.2178/JSL/1245158095MaRDI QIDQ3399188zbMATH OpenOpenAlexFDO

Authors Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu

Publication date 29 September 2009

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

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

zbMATH Keywords

generalized high/low hierarchiesgeneric degreerecursively enumerable in and above

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Recommendations

• Highness, locally noncappability and nonboundings
• Genericity and Non-bounding in the Enumeration degrees
• Density of non-p-generic and non-branching r.e. degrees in r.e. low degrees
• Bounding minimal degrees by computably enumerable degrees
• Bounding and nonbounding minimal pairs in the enumeration degrees

Cites work

• A 1-generic degree with a strong minimal cover
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Jump restricted interpolation in the recursively enumerable degrees
• Lowness for genericity
• Relative recursive enumerability of generic degrees
• Turing degrees of certain isomorphic images of computable relations

Cited in

(7)

• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• 2010 North American Annual Meeting of the Association for Symbolic Logic
• A 2-MINIMAL NON-GL₂ DEGREE
• Relatively computably enumerable reals
• Array nonrecursiveness and relative recursive enumerability
• Domination, forcing, array nonrecursiveness and relative recursive enumerability

This page was built for publication: Bounding non-GL₂ and R.E.A.

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