Switch to: Citations

Add references

You must login to add references.
  1. Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
    Download  
     
    Export citation  
     
    Bookmark   38 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  
  • How Enumeration Reducibility Yields Extended Harrington Non-Splitting.Mariya I. Soskova & S. Barry Cooper - 2008 - Journal of Symbolic Logic 73 (2):634 - 655.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
    Download  
     
    Export citation  
     
    Bookmark   20 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  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6f9648bdd6-8h97j uwo