Find a number n which encodes the function Pred(x) (that is, F(n) = Pred(x)), where Pred(x) is defined by primitive recursion as the function such that Pred(0) = 0 and Pred(n + 1) = n
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
