1. The function SUCC that occurs in programming languages such as Ada or Pascal and produces the next element of an enumeration type. Typically
2. The function
where
N is the nonnegative integers.
S plays a crucial role in recursive function theory, particularly in the definition of primitive recursive functions.