Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Cooper (1982)
Partial degrees and the density problemJournal of Symbolic Logic, 47
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
S. Cooper, C. Copestake (1988)
Properly Σ2 Enumeration DegreesMath. Log. Q., 34
S. Cooper (1990)
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
A. Lachlan, R. Shore (1992)
Then-rea enumeration degrees are denseArchive for Mathematical Logic, 31
Kevin McEvoy, S. Cooper (1985)
On minimal pairs of enumeration degreesJournal of Symbolic Logic, 50
C. Spector (1956)
On Degrees of Recursive UnsolvabilityAnnals of Mathematics, 64
R. Goodstein, H. Rogers (1969)
Theory of Recursive Functions and Effective ComputabilityThe Mathematical Gazette, 53
We show that the Δ0 2 enumeration degrees are dense. We also show that for every nonzero n-c. e. e-degree a, with n≥ 3, one can always find a nonzero 3-c. e. e-degree b such that b < a on the other hand there is a nonzero ωc. e. e-degree which bounds no nonzero n-c. e. e-degree.
Archive for Mathematical Logic – Springer Journals
Published: Nov 1, 2001
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.