Provably Total Functions of Arithmetic with Basic Terms

A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and existential introduction.Comment: In Proceedings DICE 2011, arXiv:1201.034