Switch to: Citations

Add references

You must login to add references.
  1. 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   29 citations  
  • Ρ-inaccessible ordinals, collapsing functions and a recursive notation system.Gerhard Jäger - 1984 - Archive for Mathematical Logic 24 (1):49-62.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A simplification of the Bachmann method for generating large countable ordinals.Jane Bridge - 1975 - Journal of Symbolic Logic 40 (2):171-185.
    Download  
     
    Export citation  
     
    Bookmark   9 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-7674574dd6-jhp86 uwo