The strong anticupping property for recursively enumerable degrees

Journal of Symbolic Logic 54 (2):527-539 (1989)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274867
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 42,142
Through your library

References found in this work BETA

Complementing Below Recursively Enumerable Degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.

Add more references

Citations of this work BETA

Dynamic Notions of Genericity and Array Noncomputability.Benjamin Schaeffer - 1998 - Annals of Pure and Applied Logic 95 (1-3):37-69.
Intervals Containing Exactly One C.E. Degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
17 ( #482,130 of 2,253,604 )

Recent downloads (6 months)
9 ( #157,100 of 2,253,604 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature