Author:
Ambos-Spies Klaus,Ding Decheng,Wang Wei,Yu Liang
Abstract
AbstractWe prove that every Turing degree a bounding some non-GL2 degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.
Publisher
Cambridge University Press (CUP)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献