Switch to: References

Add citations

You must login to add citations.
  1. Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
    E -recursive enumerability is compared via forcing to Σ 1 definability. It is shown that for every countable E -closed ordinal κ there is a set of reals, X, so that L κ [ X ] is the least E -closed structure over X.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Power set recursion.Lawrence S. Moss - 1995 - Annals of Pure and Applied Logic 71 (2):247-306.
    Download  
     
    Export citation  
     
    Bookmark   4 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-5d8df9484f-rkp68 uwo