We prove that every Turing degree a bounding some non-GL(2) degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.
科研之友
微信
新浪微博
Facebook
分享链接
