Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • 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  
  • Degree theoretic definitions of the low2 recursively enumerable sets.Rod Downey & Richard A. Shore - 1995 - Journal of Symbolic Logic 60 (3):727 - 756.
    Download  
     
    Export citation  
     
    Bookmark   6 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  
  • Working below a high recursively enumerable degree.Richard A. Shore & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (3):824-859.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On the Degrees Less than 0'.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (1):60-60.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.Robert I. Soare - 1982 - Annals of Mathematical Logic 22 (1):69.
    Download  
     
    Export citation  
     
    Bookmark   11 citations