primitive recursive function m, n Kn m : Nn → N Kn m(x1, . . . , xn) = m 1 ≤ i ≤ n Pn i : Nn → N Pn i (x1, x2, . . . , xn) = xi P1 1 : N → N (successor) S : N → N S(x) = x + 1 1. 3. 1. Kn m, Pn i , S 2. f : Nm → N fi : Nn → N (i = 1, 2, . . . , m) g(x1, . . . , xn) = f(f1(x1, . . . , xn), . . . , fm(x1, . . . , xn)) g : Nn → N 3. f : Nn → N g : Nn+2 → N h(x1, . . . , xn, 0) = f(x1, . . . , xn) h(x