Switch to: Citations

Add references

You must login to add references.
  1. Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Jump embeddings in the Turing degrees.Peter G. Hinman & Theodore A. Slaman - 1991 - Journal of Symbolic Logic 56 (2):563-591.
    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  
  • Embedding jump upper semilattices into the Turing degrees.Antonio Montalbán - 2003 - Journal of Symbolic Logic 68 (3):989-1014.
    We prove that every countable jump upper semilattice can be embedded in.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • [Omnibus Review].M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
    Download  
     
    Export citation  
     
    Bookmark   22 citations