Successor function

For other uses, see Successor (disambiguation).

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: H₀(a, b) = 1 + b.

anime

See also

• Successor ordinal
• Successor cardinal
• Increment and decrement operators

References

• Paul R. Halmos (1968). Naive Set Theory. Nostrand.