Switch to: Citations

Add references

You must login to add references.
  1. Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • (1 other version)Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.
    Download  
     
    Export citation  
     
    Bookmark   163 citations  
  • Partial degrees and the density problem.S. B. Cooper - 1982 - Journal of Symbolic Logic 47 (4):854-859.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Degrees of Unsolvability. Local and Global Theory.Carl G. Jockusch - 1985 - Journal of Symbolic Logic 50 (2):549-550.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • 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-7f8ff5d46-qj788 uwo