Natural-number recursion theorem
= Natural-number recursion theorem
Given an initial value $a$ and a rule $G$, there is a unique function $F$ on $\omega$ satisfying $F(0)=a$ and $F(n+1)=G(F(n))$.
= Natural-number recursion theorem
Given an initial value $a$ and a rule $G$, there is a unique function $F$ on $\omega$ satisfying $F(0)=a$ and $F(n+1)=G(F(n))$.