Density results in the Delta20 e-degrees


We show that the 2 enumeration degrees are dense. We also show that for every nonzero n-c. e. e-degree a, with n ≥ 3, one can always find a nonzero 3-c. e. e-degree b such that b < a; on the other hand there is a nonzero ω-c. e. e-degree which bounds no nonzero n-c. e. e-degree. Enumeration reducibility is a formalization of the intuitive notion of relative… (More)
DOI: 10.1007/s001530100078


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics