Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Second order arithmetic and related topics.K. R. Apt & W. Marek - 1974 - Annals of Mathematical Logic 6 (3):177.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Definability in models of set theory.David Guaspari - 1980 - Journal of Symbolic Logic 45 (1):9-19.
    Download  
     
    Export citation  
     
    Bookmark  
  • Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Uncountable master codes and the jump hierarchy.Robert S. Lubarsky - 1987 - Journal of Symbolic Logic 52 (4):952-958.
    Download  
     
    Export citation  
     
    Bookmark