Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T14:09:32.196Z Has data issue: false hasContentIssue false

Bounding non-GL2 and R.E.A.

Published online by Cambridge University Press:  12 March 2014

Klaus Ambos-Spies
Affiliation:
Institut für Informatik, University of Heidelberg, Im Neuenheimer Feld 294, 69120 Heidelberg, Germany, E-mail: ambos@math.uni-heidelberg.de
Decheng Ding
Affiliation:
Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R., China, E-mail: dcding@nju.edu.cn
Wei Wang*
Affiliation:
Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R., China, E-mail: wwang.cn@gmail.com
Liang Yu
Affiliation:
Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R., China, E-mail: yuliang.nju@gmail.com
*
Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Singapore

Abstract

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

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable