Primitive recursive function: Difference between revisions

Revision as of 18:24, 19 December 2003

Revision as of 18:25, 19 December 2003

Line 7:

#The [[constant term|constant function]] 0 is primitive recursive.

#The "''successor function"'' ''S'', which takes one argument and returns the succeeding number as given by the [[Peano postulates]], is primitive recursive.

#The "''projection functions"'' ''P''_''i''^''n'', which take ''n'' arguments and return their ''i''th argument, are primitive recursive.

More complex primitive recursive functions can be obtained by applying the [[operator]]s given by these axioms: