Journal of Symbolic Logic

Relative enumerability and 1-genericity

Wei Wang

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


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.

Article information

J. Symbolic Logic, Volume 76, Issue 3 (2011), 897-913.

First available in Project Euclid: 6 July 2011

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03D28: Other Turing degree structures 03D25: Recursively (computably) enumerable sets and degrees

Turing degrees relative enumerability 1-generic


Wang, Wei. Relative enumerability and 1-genericity. J. Symbolic Logic 76 (2011), no. 3, 897--913. doi:10.2178/jsl/1309952526.

Export citation