 Primitive recursive arithmetic

Primitive recursive arithmetic (PRA) is a quantifier-free formalization of the natural numbers.It was first proposed by Skolem as a formalization of his finitist conception of the foundations of arithmetic, and it is widely agreed that all reasoning of PRA is finitist.