Abstract
A set of natural numbers B is computably enumerable in and strictly above (or c.e.a. for short) another set C if C <T B 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.
Citation
Wei Wang. "Relative enumerability and 1-genericity." J. Symbolic Logic 76 (3) 897 - 913, September 2011. https://doi.org/10.2178/jsl/1309952526
Information
