Abstract
AbstractA set of natural numbers B is computably enumerable in and strictly above (or c.e.a. for short) another set C if C <TB and B is computably enumerable in C. A Turing degree b is c.e.a. c if b and c respectively contain B and C as above. In this paper, it is shown that if b is c.e.a. c then b is c.e.a. some 1-generic g.
Publisher
Cambridge University Press (CUP)
Reference9 articles.
1. Kurtz Stuart , Randomness and genericty in the degrees of unsolvability, Ph.D. thesis, University of Illinios at Urbana-Champaign, 1981.
2. Recursively Enumerable Sets and Degrees
3. The continuity of cupping to 0'
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献