Article contents
Cupping Δ20 enumeration degrees to 0e′†
Published online by Cambridge University Press: 01 February 2009
Abstract
In this paper we prove that every non-zero Δ20e-degree is cuppable to 0e′ by a 1-generic Δ20e-degree (and is thus low and non-total), and that every non-zero ω-c.e. e-degree is cuppable to 0e′ by an incomplete 3-c.e. e-degree.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 19 , Special Issue 1: Theory and Applications of Models of Computation (TAMC) , February 2009 , pp. 169 - 191
- Copyright
- Copyright © Cambridge University Press 2009
References
- 2
- Cited by