A note on parameter free Π₁-induction and restricted exponentiation

This publication has 10 references indexed in Scilit:

• Fragments of Arithmetic and true sentences
  Mathematical Logic Quarterly, 2005
• Induction, minimization and collection for ? n+1 (T)?formulas
  Archive for Mathematical Logic, 2004
• On the quantifier complexity of ? n+1 (T)? induction
  Archive for Mathematical Logic, 2004
• Parameter free induction and provably total computable functions
  Theoretical Computer Science, 1999
• On Σ₁‐definable Functions Provably Total in I ∏
  Mathematical Logic Quarterly, 1995
• Metamathematics of First-Order Arithmetic
  1993
• Models of Peano Arithmetic
  1991
• On parameter free induction schemas
  The Journal of Symbolic Logic, 1988
• On the scheme of induction for bounded arithmetic formulas
  Annals of Pure and Applied Logic, 1987
• On n-quantifier induction
  The Journal of Symbolic Logic, 1972