Editing Primitive recursive function (section)

== Finitism and consistency results ==

The primitive recursive functions are closely related to mathematical [[finitism]], and are used in several contexts in mathematical logic where a particularly constructive system is desired. [[Primitive recursive arithmetic]] (PRA), a formal axiom system for the natural numbers and the primitive recursive functions on them, is often used for this purpose.

PRA is much weaker than [[Peano arithmetic]], which is not a finitistic system. Nevertheless, many results in [[number theory]] and in [[proof theory]] can be proved in PRA. For example, [[Gödel's incompleteness theorem]] can be formalized into PRA, giving the following theorem:
:If ''T'' is a theory of arithmetic satisfying certain hypotheses, with Gödel sentence ''G''<sub>''T''</sub>, then PRA proves the implication Con(''T'')→''G''<sub>''T''</sub>.
Similarly, many of the syntactic results in proof theory can be proved in PRA, which implies that there are primitive recursive functions that carry out the corresponding syntactic transformations of proofs.

In proof theory and [[set theory]], there is an interest in finitistic [[consistency proof]]s, that is, consistency proofs that themselves are finitistically acceptable. Such a proof establishes that the consistency of a theory ''T'' implies the consistency of a theory ''S'' by producing a primitive recursive function that can transform any proof of an inconsistency from ''S'' into a proof of an inconsistency from ''T''.  One sufficient condition for a consistency proof to be finitistic is the ability to formalize it in PRA. For example, many consistency results in set theory that are obtained by [[forcing (mathematics)|forcing]] can be recast as syntactic proofs that can be formalized in PRA.