Bounding non-GL₂ and R.E.A.
Klaus Ambos-Spies, Decheng Ding, Wei Wang, and Liang Yu
Source: J. Symbolic Logic Volume 74, Issue 3 (2009), 989-1000.
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.
Primary Subjects: 03D28, 03D55
Keywords: Generalized high/low hierarchies; recursively enumerable in and above; generic degree
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
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1245158095
Digital Object Identifier: doi:10.2178/jsl/1245158095
Zentralblatt MATH identifier:
05609400
References
Valentina S. Harizanov, Turing degrees of certain isomorphic images of computable relations, Ann. Pure Appl. Logic, vol. 93 (1998), no. 1--3, pp. 103--113.
Mathematical Reviews (MathSciNet):
MR1635602
Digital Object Identifier: doi:10.1016/S0168-0072(97)00056-0
Denis R. Hirschfeldt and Richard A. Shore, Combinatorial principles weaker than Ramsey's theorem for pairs, Journal of Symbolic Logic, vol. 72 (2007), no. 1, pp. 171--206.
Mathematical Reviews (MathSciNet):
MR2298478
Digital Object Identifier: doi:10.2178/jsl/1174668391
Project Euclid: euclid.jsl/1174668391
Carl G. Jockusch, Jr, Degrees of generic sets, Recursion theory: Its generalizations and applications. Proceedings of Logic Colloquium '79, Leeds, August 1979 (Cambridge, U. K.) (F. R. Drake and S. S. Wainer, editors), Cambridge University Press, 1980, pp. 110--139.
Mathematical Reviews (MathSciNet):
MR598304
Carl G. Jockusch, Jr. and David B. Posner, Double jumps of minimal degrees, Journal of Symbolic Logic, vol. 43 (1978), no. 4, pp. 715--724.
Mathematical Reviews (MathSciNet):
MR518677
Digital Object Identifier: doi:10.2307/2273510
JSTOR: links.jstor.org
Masahiro Kumabe, Relative recursive enumerability of generic degrees, Journal of Symbolic Logic, vol. 56 (1991), no. 3, pp. 1075--1084.
Mathematical Reviews (MathSciNet):
MR1129169
Digital Object Identifier: doi:10.2307/2275074
JSTOR: links.jstor.org
--------, A $1$-generic degree with a strong minimal cover, Journal of Symbolic Logic, vol. 65 (2000), no. 3, pp. 1395--1442.
Mathematical Reviews (MathSciNet):
MR1791382
Digital Object Identifier: doi:10.2307/2586706
JSTOR: links.jstor.org
M. Lerman, Degrees of unsolvability, Perspectives in Mathematical Logic, Springer--Verlag, Heidelberg, 1983, 307 pages.
Mathematical Reviews (MathSciNet):
MR708718
D. A. Martin, Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Logik Grundlag. Math., vol. 12 (1966), pp. 295--310.
Mathematical Reviews (MathSciNet):
MR224469
R. W. Robinson, Jump restricted interpolation in the recursively enumerable degrees, Ann. of Math. (2), vol. 93 (1971), pp. 586--596.
Mathematical Reviews (MathSciNet):
MR313037
Digital Object Identifier: doi:10.2307/1970889
JSTOR: links.jstor.org
L. P. Sasso, A minimal degree not realizing least possible jump, Journal of Symbolic Logic, vol. 39 (1974), pp. 571--574.
Mathematical Reviews (MathSciNet):
MR360242
Digital Object Identifier: doi:10.2307/2272899
JSTOR: links.jstor.org
Robert I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer--Verlag, Heidelberg, 1987.
Mathematical Reviews (MathSciNet):
MR882921
Liang Yu, Lowness for genericity, Arch. Math. Logic, vol. 45 (2006), no. 2, pp. 233--238.
Mathematical Reviews (MathSciNet):
MR2209745
Digital Object Identifier: doi:10.1007/s00153-005-0306-y
