Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. An almost deep degree;Cholak;J. Symbolic Logic,2001
2. Minimal pairs and high recursively enumerable degrees;Cooper;J. Symbolic Logic,1974
3. On a Theorem of C. E. M. Yates (Handwritten Notes);Cooper,1974
4. Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable;Cooper;J. Symbolic Logic,2002
5. Highness and bounding minimal pairs;Downey;Math. Logic Quarterly,1993