Switch to: Citations

Add references

You must login to add references.
  1. Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.Carl G. Jockusch & Richard A. Shore - 1984 - Journal of Symbolic Logic 49 (4):1205 - 1236.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Jumping through the transfinite: The master code hierarchy of Turing degrees.Harold T. Hodes - 1980 - Journal of Symbolic Logic 45 (2):204-220.
    Where $\underline{a}$ is a Turing degree and ξ is an ordinal $ , the result of performing ξ jumps on $\underline{a},\underline{a}^{(\xi)}$ , is defined set-theoretically, using Jensen's fine-structure results. This operation appears to be the natural extension through $(\aleph_1)^{L^\underline{a}}$ of the ordinary jump operations. We describe this operation in more degree-theoretic terms, examine how much of it could be defined in degree-theoretic terms and compare it to the single jump operation.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.
    Download  
     
    Export citation  
     
    Bookmark   39 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  
  • Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
    Download  
     
    Export citation  
     
    Bookmark   22 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  
  • Transfinite extensions of Friedberg's completeness criterion.John M. Macintyre - 1977 - Journal of Symbolic Logic 42 (1):1-10.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)On Degrees of Unsolvability.J. R. Shoenfield - 1964 - Journal of Symbolic Logic 29 (4):203-204.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • (1 other version)A criterion for completeness of degrees of unsolvability.Richard Friedberg - 1957 - Journal of Symbolic Logic 22 (2):159-160.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Recursive Enumerability and the Jump Operator.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):204-204.
    Download  
     
    Export citation  
     
    Bookmark   15 citations