Definition 8.2.3: for n-ary total function f and (n+2)-ary total function g, the primitive recursion of f and g is the (n+1)-ary function h, written pr(f,g), defined by
h(x1, x2, … , xn, 0) = f(x1, x2, … , xn),
and for each y_Nath(x1, … , xn, y+1) = g(y, h(x1, … , xn, y), x1, … , xn).
Definition 8.2.4: for the (n+1)-ary total function f, the minimalization of f is the n-ary function g defined by smallest y_Nat so that f(x1, x2, … , xn, y) = 0 g(x1, x2, … , xn) = undefined if no such y exists
{
Previous slide | Next slide | Back to first slide | View graphic version |