Translator Disclaimer
September 2009 Bounding non-GL₂ and R.E.A.
Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu
J. Symbolic Logic 74(3): 989-1000 (September 2009). DOI: 10.2178/jsl/1245158095

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.

Citation

Download Citation

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

Information

Published: September 2009
First available in Project Euclid: 16 June 2009

zbMATH: 1201.03025
MathSciNet: MR2548472
Digital Object Identifier: 10.2178/jsl/1245158095

Subjects:
Primary: 03D28, 03D55

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.74 • No. 3 • September 2009
Back to Top