Bulletin of the American Mathematical Society · 1981 · 63 citations · 36 references
Natural SciencesMathematicsDiscrete MathematicsPhilosophy Of MathematicsSet TheoryAxiomatic Set TheoryPredicate LogicStructural ComplexityUniversal AlgebraCompletenessComplexity-theoretic HardnessPost's ProblemReducibilityUndecidability
Acknowledgements 1. Introduction 2. Where it all started: Post's problem and ^-completeness 3. The structure inside single degrees 4. The structure of m-degrees 5. The structure of 1-degrees 6. The structure of //-degrees 7. Elementary equivalence and undecidability 8. Where we end: variations on the theme of ^-reductibility Acknowledgements. During the writing of the first draft I have been helped in many ways by Carl Jockusch, Jr., who patiently explained to me an incredible number of results on these and other topics.
36
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
On the Structure of Polynomial Time Reducibility
Richard E. Ladner · Journal of the ACM · 1975 · 790 citations · Full text
Donald A. Martin · Annals of Mathematics · 1975 · 581 citations