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  
  • Recursice well-founded orderings.D. -H. Chen - 1978 - Annals of Mathematical Logic 13 (2):117.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Degrees of Unsolvability.Joseph R. Shoenfield - 1975 - Studia Logica 34 (3):284-288.
    Download  
     
    Export citation  
     
    Bookmark   12 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-9b866bbb8-nm99f uwo