SUPPORT THE WORK

# GetWiki

### Successor function

ARTICLE SUBJECTS
news  →
unix  →
wiki  →
ARTICLE TYPES
feed  →
help  →
wiki  →
ARTICLE ORIGINS
Successor function
[ temporary import ]
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{other uses|Successor (disambiguation)}}In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by S, so S(n) = n+1. For example, S(1) = 2 and S(2) = 3. The successor function is one of the basic components to build a primitive recursive function from.Successor operations are also known as zeration in the context of a zeroth hyperoperation: H0(a, b) = 1 + b. In this context, the extension of zeration is addition, which is defined as repeated succession.

## Overview

The successor function is part of the language used to state the Peano axioms, which formalise the structure of the natural numbers. In this formalisation, the successor function is a primitive operation on the natural numbers in terms of which the standard natural numbers and addition is defined. For example, 1 is defined to be S(0), and addition on natural numbers is defined recursively by:
{|
m + 0 >| = m
m + S(n) >| = S(m + n)
This can be used to compute addition of any two natural numbers. For example, 5 + 2 = 5 + S(1) = S(5 + 1) = S(5 + S(0)) = S(S(5 + 0)) = S(S(5)) = S(6) = 7.Several constructions of the set of natural numbers within set theory have been proposed. For example, John von Neumann constructs the number 0 as the empty set {}, and the successor number S(n) as the set n âˆª { n }. The axiom of infinity then guarantees the existence of a set that contains 0 and is closed with respect to S. The smallest such set is denoted by â„•, and its members are called natural numbers.Halmos, Chapter 11The successor function is the level-0 foundation of the infinite Grzegorczyk hierarchy of hyperoperations, used to build addition, multiplication, exponentiation, tetration, etc.. It was studied in 1986 in an investigation involving generalization of the pattern for hyperoperations.WEB, Rubtsov, C.A., Romerio, G.F., Ackermann's Function and New Arithmetical Operations, 2004,weblink It is also one of the primitive functions used in the characterization of computability by recursive functions.

## References

{{reflist}}
• BOOK, Paul R. Halmos, Naive Set Theory, 1968, Nostrand,
{{Hyperoperations}}{{mathlogic-stub}}

- content above as imported from Wikipedia
- "Successor function" does not exist on GetWiki (yet)
- time: 8:42am EDT - Tue, Aug 20 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014
CONNECT