basic constructions:
strong axioms
further
In proof theory, primitive recursive arithmetic, or PRA, is a finitist, quantifier-free formalization of the natural numbers.
PRA can express arithmetic propositions involving natural numbers and any primitive recursive function?, including the operations of addition, multiplication, and exponentiation.
Created on November 7, 2018 at 07:27:55. See the history of this page for a list of all contributions to it.