Article contents
Properly enumeration degrees and the high/low hierarchy
Published online by Cambridge University Press: 12 March 2014
Abstract
We show that there exist downwards properly (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2006
References
REFERENCES
- 3
- Cited by