pdf online search and view

the initial values ai = 1 for i < k. For k = 2 or 3, these recursions are very simple (there is no addition on the right-hand side) and they define the

x),z,x) A primitive recursive ordinal function is defined in the same way, except that the initial function F(x,y) = x∪{y} is replaced by F(x) = x∪{x}