Journal of Symbolic Logic

Bounding non-GL₂ and R.E.A.

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

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We prove that every Turing degree a bounding some non-GL₂ degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.

Article information

Source
J. Symbolic Logic, Volume 74, Issue 3 (2009), 989-1000.

Dates
First available in Project Euclid: 16 June 2009

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1245158095

Digital Object Identifier
doi:10.2178/jsl/1245158095

Mathematical Reviews number (MathSciNet)
MR2548472

Zentralblatt MATH identifier
1201.03025

Subjects
Primary: 03D28: Other Turing degree structures 03D55: Hierarchies

Keywords
Generalized high/low hierarchies recursively enumerable in and above generic degree

Citation

Ambos-Spies, Klaus; Ding, Decheng; Wang, Wei; Yu, Liang. Bounding non- GL ₂ and R.E.A. J. Symbolic Logic 74 (2009), no. 3, 989--1000. doi:10.2178/jsl/1245158095. https://projecteuclid.org/euclid.jsl/1245158095


Export citation