Translator Disclaimer
September 2011 Relative enumerability and 1-genericity
Wei Wang
J. Symbolic Logic 76(3): 897-913 (September 2011). DOI: 10.2178/jsl/1309952526

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

Download 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

Published: September 2011
First available in Project Euclid: 6 July 2011

zbMATH: 1260.03079
MathSciNet: MR2849251
Digital Object Identifier: 10.2178/jsl/1309952526

Subjects:
Primary: 03D25, 03D28

Rights: Copyright © 2011 Association for Symbolic Logic

JOURNAL ARTICLE
17 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.76 • No. 3 • September 2011
Back to Top