Switch to: Citations

Add references

You must login to add references.
  1. On 퐧-Quantifier Induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466 - 482.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Note on the Fan theorem.A. S. Troelstra - 1974 - Journal of Symbolic Logic 39 (3):584-596.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
    Download  
     
    Export citation  
     
    Bookmark   117 citations  
  • (1 other version)On n-quantifier induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466-482.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Partial realizations of Hilbert's program.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (2):349-363.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • (1 other version)Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.
    We establish by elementary proof-theoretic means the conservativeness of two subsystems of analysis over primitive recursive arithmetic. The one subsystem was introduced by Friedman [6], the other is a strengthened version of a theory of Minc [14]; each has been shown to be of considerable interest for both mathematical practice and metamathematical investigations. The foundational significance of such conservation results is clear: they provide a direct finitist justification of the part of mathematical practice formalizable in these subsystems. The results are (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations