Bounding non-GL2 and R.E.A.

DOI10.2178/jsl/1245158095zbMath1201.03025MaRDI QIDQ3399188

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

Publication date: 29 September 2009

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

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

zbMATH Keywords

generic degree; recursively enumerable in and above; generalized high/low hierarchies

Mathematics Subject Classification ID

03D28: Other Turing degree structures

Related Items

Array nonrecursiveness and relative recursive enumerability, Domination, forcing, array nonrecursiveness and relative recursive enumerability, Relatively computably enumerable reals, Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$, 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

Cites Work

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