Provably Total Functions of Arithmetic with Basic Terms

Evgeny Makarov

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment