Article contents
Decomposition and infima in the computably enumerable degrees
Published online by Cambridge University Press: 12 March 2014
Abstract
Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ∪ c) ∩ (b ∪ c), a ∪ c ∣ b ∪ c, and c < a ∪ b.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2003
References
REFERENCES
- 3
- Cited by