Math 2.0

definition

Successor function

Definition

Let N\mathbb{N} be the set of natural numbers. The successor function is the function S ⁣:N→NS \colon \mathbb{N} \to \mathbb{N} with S(n)=n+1S(n) = n + 1 for each nn in N\mathbb{N}. The number S(n)S(n) is the successor of nn.

Remarks

In the Peano axioms, SS is a primitive function, and the axioms do not define it. Then n+1n + 1 is a name for S(n)S(n), and 11 is a name for S(0)S(0). For example, S(0)=1S(0) = 1, S(1)=2S(1) = 2 and S(S(2))=4S(S(2)) = 4.

Explanations

L1 human

The successor of a number is the number that comes after it when you count. The successor of 44 is 55, and the successor of 00 is 11.

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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Natural numbers object
  2. Peano axioms concept
  3. Successor function definition

What depends on this

11 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Successor_function, lead section
  2. Web https://en.wikipedia.org/wiki/Successor_function, Overview