Article contents
Bounding and nonbounding minimal pairs in the enumeration degrees
Published online by Cambridge University Press: 12 March 2014
Abstract
We show that every nonzero Δ20, e-degree bounds a minimal pair. On the other hand, there exist Σ20, e-degrees which bound no minimal pair.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2005
References
REFERENCES
- 6
- Cited by