Content deleted Content added
→Pure recursion: correction, I misread the statement of Severin's result |
|||
Line 289:
:<math>\begin{align} f(0) & = 0,\\
f(S(y)) & = h(f(y)), \end{align}</math>
suffices to generate all [[unary operation|unary]] primitive recursive functions if we extend the set of initial functions with truncated subtraction ''x ∸ y''. We get ''all'' primitive recursive functions if we additionally include + as an initial function.
=== Additional primitive recursive forms ===
| |||