Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   596 citations  
  • (1 other version)A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • (1 other version)Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • (3 other versions)Mathematical Logic.J. Donald Monk - 2001 - Bulletin of Symbolic Logic 7 (3):376-376.
    Download  
     
    Export citation  
     
    Bookmark   99 citations  
  • (1 other version)Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20-22):341-352.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • (1 other version)Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
    Download  
     
    Export citation  
     
    Bookmark   16 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-6d5f778f9-g8xwj uwo