Provably Total Functions of Arithmetic with Basic Terms
arXiv:1201.1121 · doi:10.4204/EPTCS.75.3
Abstract
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.
In Proceedings DICE 2011, arXiv:1201.0345