Switch to: Citations

Add references

You must login to add references.
  1. Degrees joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
    It is shown that if A and C are sets of degrees uniformly recursive in 0' with $\mathbf{0} \nonin \mathscr{C}$ then there is a degree b with b' = 0', b ∪ c = 0' for every c ∈ C, and $\mathbf{a} \nleq \mathbf{b}$ for every a ∈ A ∼ {0}. The proof is given as an oracle construction recursive in 0'. It follows that any nonrecursive degree below 0' can be joined to 0' by a degree strictly below 0'. (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • A minimal degree not realizing least possible jump.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):571-574.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1978 - Journal of Symbolic Logic 43 (3):601-612.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A note on the hyperarithmetical hierarchy.H. B. Enderton & Hilary Putnam - 1970 - Journal of Symbolic Logic 35 (3):429-430.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On Degrees of Recursive Unsolvability.Clifford Spector - 1957 - Journal of Symbolic Logic 22 (4):374-375.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (1 other version)Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • Two theorems on degrees of models of true arithmetic.Julia Knight, Alistair H. Lachlan & Robert I. Soare - 1984 - Journal of Symbolic Logic 49 (2):425-436.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
    A uniform upper bound on a class of Turing degrees is the Turing degree of a function which parametrizes the collection of all functions whose degree is in the given class. I prove that if a is a uniform upper bound on an ideal of degrees then a is the jump of a degree c with this additional property: there is a uniform bound b<a so that b V c < a.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
    I first seriously contemplated writing a book on degree theory in 1976 while I was visiting the University of Illinois at Chicago Circle. There was, at that time, some interest in ann-series book about degree theory, and through the encouragement of Bob Soare, I decided to make a proposal to write such a book. Degree theory had, at that time, matured to the point where the local structure results which had been the mainstay of the earlier papers in the area (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Degrees of Models of True Arithmetic.David Marker, J. Stern, Julia Knight, Alistair H. Lachlan & Robert I. Soare - 1987 - Journal of Symbolic Logic 52 (2):562-563.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
    Download  
     
    Export citation  
     
    Bookmark   24 citations