Switch to: Citations

Add references

You must login to add references.
  1. The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   270 citations  
  • Three theorems on recursive enumeration. I. decomposition. II. maximal set. III. enumeration without duplication.Richard M. Friedberg - 1958 - Journal of Symbolic Logic 23 (3):309-316.
    Download  
     
    Export citation  
     
    Bookmark   43 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  
  • Recursively Enumerable Sets of Positive Integers and Their Decision Problems.Emil L. Post - 1945 - Journal of Symbolic Logic 10 (1):18-19.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • Maximal alpha-r.e. sets and their complements.Anne Leggett - 1974 - Annals of Mathematical Logic 6 (3/4):293.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Recursion, metarecursion, and inclusion.James C. Owings - 1967 - Journal of Symbolic Logic 32 (2):173-179.
    Download  
     
    Export citation  
     
    Bookmark   10 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-6686886f5-ktvwr uwo