Successor function

In mathematics, the successor function or successor operation is a primitive recursive function S such that S(n) = n+1 for each natural number n.For example, S(1) = 2 and S(2) = 3. Successor operations are also known as zeration in the context of a zeroth hyperoperation: H0(a, b) = 1 + b.

Successor function

In mathematics, the successor function or successor operation is a primitive recursive function S such that S(n) = n+1 for each natural number n.For example, S(1) = 2 and S(2) = 3. Successor operations are also known as zeration in the context of a zeroth hyperoperation: H0(a, b) = 1 + b.