Successor function
Definition
Let be the set of natural numbers. The successor function is the function with for each in . The number is the successor of .
Remarks
In the Peano axioms, is a primitive function, and the axioms do not define it. Then is a name for , and is a name for . For example, , and .
Explanations
L1 human
The successor of a number is the number that comes after it when you count. The successor of is , and the successor of is .
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Natural numbers object
- Peano axioms concept
- Successor function definition
What depends on this
11 nodes use this node, directly or through other nodes.
- Well-ordering principle 01BX15HSRR
- Associativity of addition 0C32J27WQC
- Zero is not a successor 0D752BG155
- Commutativity of addition 0DFZNHJ0S2
- Induction from an arbitrary base case 0GF6AJEBZ0
- Multiplication of natural numbers 0JRC32D6K2
- Distributive law 0KBEMAJAYA
- Strong induction 0KMVFSHFGZ
- The successor function is injective 0TBYMWPWWB
- Addition of natural numbers 0W5DSDFQ4G
- Order on the natural numbers 0Y9H52BT03
Sources
What links here
Used by
- Zero is not a successor 0D752BG155
- Multiplication of natural numbers 0JRC32D6K2
- The successor function is injective 0TBYMWPWWB
- Addition of natural numbers 0W5DSDFQ4G