Live briefing
Everything about Successor function
Elementary operation on a natural number
In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by , so . For example, and . The successor function is one of the basic components used to build a primitive recursive function. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Successor functionA 5-minute orientation
- Skim a recent paper: On Undecidability of Unary Nonnested PFP Operators for One Successor Function TheoryInfluential work since 2022
- Pick up a classic book: Die Goten. Von den Anfängen bis zur Mitte des sechsten JahrhundertsThe most-reprinted book on the subject
- Read the landmark paper: Function, governance, and trust in successor leadership groups in family firmsCited 58 times
- Go sideways: Primitive recursive arithmeticA closely related topic
- Go sideways: Robinson arithmeticA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Function, governance, and trust in successor leadership groups in family firms
On the Sequentiality of the Successor Function
Starting small: exploring the origins of successor function knowledge
What Counts? Sources of Knowledge in Children’s Acquisition of the Successor Function
Children’s early understanding of the successor function
The carry propagation of the successor function
The Successor Function and Induction Principle in a Hegelian Philosophy of Mathematics
Computational complexity of logical theories of one successor and another unary function
🆕 Influential since 2022
📚 Books worth reading
Die Goten. Von den Anfängen bis zur Mitte des sechsten JahrhundertsHerwig Wolfram · 1979
Ten epochs of church historyFulton, John, 1834-1907, Locke, Clinton, 1829-1904 · 1879
The dramatic festivals of AthensArthur W. Pickard-Cambridge · 1953
The Conspirators HierarchyJohn Coleman · 1992
Meditations for the use of the secular clergyChaignon, Pierre, 1791-1883, Louis De Goesbriand · 1891
A treatise on the commerce and police of the River ThamesPatrick Colquhoun · 1800- 📕Reviews in modern astronomyReinhard Schielicke, Astronomische Gesellschaft (Germany). Meeting · 1996
The UNIX operating systemChristian, Kaare, Kaare Christian · 1983
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Primitive recursive arithmetic Primitive recursive arithmetic (PRA) is a quantifier-free formalization of the natural numbers. It was first proposed by Norwegian mathematician Skolem…
- Robinson arithmetic In mathematics, Robinson arithmetic is a finitely axiomatized fragment of first-order Peano arithmetic (PA), first set out by Raphael M. Robinson in 1950…
- Hyperoperation In mathematics, the hyperoperation sequence is an infinite sequence of arithmetic operations (called hyperoperations in this context) that starts with…
- Primitive recursive function In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all…
- Grzegorczyk hierarchy The Grzegorczyk hierarchy (/ɡrɛˈɡɔːrtʃək/, Polish pronunciation: [ɡʐɛˈɡɔrt͡ʂɨk]), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of…
- Peano axioms In mathematical logic, the Peano axioms (/piˈɑːnoʊ/; [peˈaːno]), also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural…
- Ackermann function In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable…
- Natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. The terms positive integers, non-negative integers, whole…