Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. I. Soare (1987)
Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Persp. Math. Log., Omega Ser.
R. Soare (1987)
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
S. Goncharov, V. Harizanov, J. Knight, Charles McCoy, Russell Miller, Reed Solomon (2005)
Enumerations in computable structure theoryAnn. Pure Appl. Log., 136
A. Morozov, V. Puzarenko (2004)
Σ-Subsets of Natural NumbersAlgebra and Logic, 43
S. Wehner (1998)
Enumerations, countable structures and Turing degrees, 126
We argue for the existence of structures with the spectrum {x : x ≰ a} of degrees, where a is an arbitrary low degree. Also it is stated that there exist structures with the spectrum of degrees, {x : x ≰ a} ⋃ {x : x ≰ b}, for any low degrees a and b.
Algebra and Logic – Springer Journals
Published: Dec 11, 2007
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.