Révision 219 CSL17/conclusions.tex

conclusions.tex (revision 219)
1 1 
\section{Conclusions}
2 
\label{sect:conclusion}
2 3 

  		





  3
  4
  
    
 We have presented a ramified arithmetic parameterized by the formulas on which induction is allowed. The hierarchy of induction formulas 


  		





  4
  5
  
    
$\Sigma_i^{\safe}$ is defined by the number of alternances of safe (unbounded) quantifiers. We have proved that the system $\arith^i$ with 


  		












Formats disponibles :
  Unified diff