From Wikipedia, the free encyclopedia
|This article does not cite any references or sources. (June 2012)|
We have S(1) = 1 + 1 = 2, S(S(1)) = 2 + 1 = 3, ...
It is also one of the primitive functions used in the characterization of computability by recursive functions.
See also 
|This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.|