Switch to: Citations

Add references

You must login to add references.
  1. A Language and Axioms for Explicit Mathematics.Solomon Feferman, J. N. Crossley, Maurice Boffa, Dirk van Dalen & Kenneth Mcaloon - 1984 - Journal of Symbolic Logic 49 (1):308-311.
    Download  
     
    Export citation  
     
    Bookmark   66 citations  
  • (1 other version)Provable wellorderings of formal theories for transfinitely iterated inductive definitions.W. Buchholz & W. Pohlers - 1978 - Journal of Symbolic Logic 43 (1):118-125.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The Type Theoretic Interpretation of Constructive Set Theory.Peter Aczel, Angus Macintyre, Leszek Pacholski & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):313-314.
    Download  
     
    Export citation  
     
    Bookmark   78 citations  
  • A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • On the regular extension axiom and its variants.Robert S. Lubarsky & Michael Rathjen - 2003 - Mathematical Logic Quarterly 49 (5):511.
    The regular extension axiom, REA, was first considered by Peter Aczel in the context of Constructive Zermelo-Fraenkel Set Theory as an axiom that ensures the existence of many inductively defined sets. REA has several natural variants. In this note we gather together metamathematical results about these variants from the point of view of both classical and constructive set theory.
    Download  
     
    Export citation  
     
    Bookmark   4 citations