Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Feiner (1970)
The strong homogeneity conjectureJournal of Symbolic Logic, 35
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
A. Lachlan (1968)
Distributive Initial Segments of the Degrees of UnsolvabilityMathematical Logic Quarterly, 14
R. Downey, R. Shore (1997)
There is no degree invariant half-jump, 125
K. Ambos-Spies, M. Lerman (1989)
Lattice embeddings into the recursively enumerable degrees. IIJournal of Symbolic Logic, 54
G. Sacks (1963)
ON THE DEGREES LESS THAN 0Annals of Mathematics, 77
R. Shore (1982)
Finitely generated codings and the degrees r.e. in a degree, 84
A. Nerode, R. Shore (1980)
Second order logic and first order theories of reducibility orderingsStudies in logic and the foundations of mathematics, 101
D. Posner (1981)
The upper semilattice of degrees ≤ 0′ is complementedJournal of Symbolic Logic, 46
M. Lerman, R. Shore, R. Soare (1984)
The elementary theory of the recursively enumerable degrees is not N0-categoricalAdvances in Mathematics, 53
Emil Post (1944)
Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 50
T. Slaman, W. Woodin (1986)
Definability in the Turing degreesIllinois Journal of Mathematics, 30
K. Ambos-Spies, M. Lerman (1986)
Lattice embeddings into the recursively enumerable degreesJournal of Symbolic Logic, 51
C. Yates (1966)
On the degrees of index sets. IITransactions of the American Mathematical Society, 135
A. Lachlan (1965)
ON A PROBLEM OF G. E. SACKS, 16
A. Lachlan (1966)
The impossibility of finding relative complements for recursively enumerable degreesJournal of Symbolic Logic, 31
S. Cooper (1972)
Minimal Upper Bounds for Sequences of Recursively Enumerable DegreesJournal of The London Mathematical Society-second Series
T. Slaman, J. Steel (1989)
Complementation in the Turing degreesJournal of Symbolic Logic, 54
J. Shoenfield (1997)
A theorem on minimal degreesJournal of Symbolic Logic, 31
T. Slaman, J. Steel (1988)
Definable functions on degrees
A. Lachlan (1966)
Lower Bounds for Pairs of Recursively Enumerable DegreesProceedings of The London Mathematical Society
G. Sacks (1965)
Degrees of unsolvabilityAmerican Mathematical Monthly, 72
L. Harrington, R. Soare (1996)
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable SetsBulletin of Symbolic Logic, 2
M. Lerman (1983)
Degrees of Unsolvability
Jr. Rogers (1969)
Theory of Recursive Functions and Effective Computability
S. Lempp, M. Lerman (1997)
A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing DegreesAnn. Pure Appl. Log., 87
A. Lachlan, R. Soare (1980)
Not every finite lattice is embeddable in the recursively enumerable degreesAdvances in Mathematics, 37
R. Shore (1979)
The homogeneity conjecture.Proceedings of the National Academy of Sciences of the United States of America, 76 9
M. Lerman (1971)
Initial segments of the degrees of unsolvabilityAnnals of Mathematics, 93
R. Platek (1966)
Foundations of recursion theory
L. Harrington, A. Kechris (1975)
A Basis Result for Σ^0_3 Sets of Reals with an Application to Minimal Covers, 53
G. Sacks (1964)
The Recursively Enumerable Degrees are DenseAnnals of Mathematics, 80
Richard Friedberg (1957)
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944).Proceedings of the National Academy of Sciences of the United States of America, 43 2
Joseph Schoenfield (1993)
Recursion theory
J. Shoenfield (1961)
Undecidable and creative theoriesFundamenta Mathematicae, 49
A. Nies, Ra Shore, Ta Slaman (1998)
Interpretability and Definability in the Recursively Enumerable DegreesProceedings of the London Mathematical Society, 77
Robert Lebeuf, E. Pechlaner, Sylvia Holmes (1976)
Countable initial segments of the degrees of unsolvabilityJournal of Symbolic Logic, 41
C. Jockusch, R. Shore (1983)
Pseudojump operators. I. The r.e. caseTransactions of the American Mathematical Society, 275
Peter Cholak, Rod Downey, Michael Stob (1992)
Automorphisms of the lattice of recursively enumerable sets: promptly simple setsTransactions of the American Mathematical Society, 332
S. Simpson (1977)
First-order theory of the degrees of recursive unsolvabilitylAnnals of Mathematics, 105
S. Kleene, Emil Post (1954)
The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 59
G. Sacks (1990)
Higher recursion theory
G. Sacks (1967)
ON A THEOREM OF LACHLAN AND MARTIN, 18
A. Lachlan (1976)
A recursively enumerable degree which will not split over all lesser onesAnnals of Mathematical Logic, 9
G. Sacks (1963)
Recursive enumerability and the jump operatorTransactions of the American Mathematical Society, 108
J. Paris (1977)
Measure and minimal degreesAnnals of Mathematical Logic, 11
G. Sacks (1972)
The differential closure of a differential fieldBulletin of the American Mathematical Society, 78
C. Jockusch, R. Shore (1984)
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal coversJournal of Symbolic Logic, 49
C. Yates (1966)
A minimal pair of recursively enumerable degreesJournal of Symbolic Logic, 31
C. Spector (1956)
On Degrees of Recursive UnsolvabilityAnnals of Mathematics, 64
P. Odifreddi (1989)
Classical recursion theory
R. Shore (1999)
The Recursively Enumerable Degrees
A. Nerode, R. Shore (1980)
Reducibility orderings: Theories, definability and automorphisms☆Annals of Mathematical Logic, 18
G. Sacks (1972)
Saturated Model Theory
T. Slaman, R. Soare (1995)
Algebraic aspects of the computably enumerable degrees.Proceedings of the National Academy of Sciences of the United States of America, 92
Leo Harrington, R. Soare (1991)
Post's program and incomplete recursively enumerable sets.Proceedings of the National Academy of Sciences of the United States of America, 88 22
C. Yates (1965)
Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 32
H. Becker (1988)
A characterization of jump operatorsJournal of Symbolic Logic, 53
G. Sacks (1969)
Measure-theoretic uniformity in recursion theory and set theoryTransactions of the American Mathematical Society, 142
C. Jockusch, R. Soare (1970)
Minimal covers and arithmetical sets, 25
M. Groszek, T. Slaman (1983)
Independence results on the global structure of the Turing degreesTransactions of the American Mathematical Society, 277
J. Steel (1982)
A classification of jump operatorsJournal of Symbolic Logic, 47
A. Lachlan (1972)
Embedding nondistributive lattices in the recursively enumerable degrees
H. Rogers (1967)
Some Problems of Definability in Recursive Function TheoryStudies in logic and the foundations of mathematics, 46
C. Yates (1970)
Initial segments of the degrees of unsolvability Part II: minimal degreesJournal of Symbolic Logic, 35
R. Shore (1982)
On homogeneity and definability in the first-order theory of the Turing degreesJournal of Symbolic Logic, 47
K. Ambos-Spies, R. Shore (1993)
Undecidability and 1-Types in the Recursively Enumerable DegreesAnn. Pure Appl. Log., 63
A. Lachlan (1975)
Uniform enumeration operationsJournal of Symbolic Logic, 40
We describe the important role that the conjectures and questions posed at the end of the two editions of Gerald Sacks's Degrees of Unsolvability have had in the development of recursion theory over the past thirty years.
Archive for Mathematical Logic – Springer Journals
Published: Aug 1, 1997
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.