By natural numbers $\mathbb{N}$ I understand any set satisfying Peano axioms:
- $0 \in \mathbb{N}$
- $\sigma : \mathbb{N} \to \mathbb{N}$
- $\forall n \in \mathbb{N} \; . \; \sigma(n) \neq 0$
- $\forall n,m \in \mathbb{N} \; . \; \sigma(n) = \sigma(m) \Rightarrow n=m$
- $\forall A \subset \mathbb{N} : \Big(0 \in A \text{ and } \forall a \in A \; . \; \sigma(a) \in A \Big) \Rightarrow A =\mathbb{N}$
In ZF existence of natural numbers $\mathbb{N}$ is deduced from the axiom infinity. The said axiom states that there exists an inductive set $X$ such that $\emptyset \in X$ and $\forall x \in X \; . \; x \cup \{ x \} \in X$ (INF).
But I don't think that the abstract inductive set $X$ is very useful by itself and what I actually want from it is a set of natural numbers. And if I don't care about exact construction of natural numbers, why not to replace axiom of infinity by the new axiom: a set of natural numbers $\mathbb{N}$ exists (NAT)?
These axioms seems to equivalent at first, as by virtue of axiom of induction $\mathbb{N}$ seems to be inductive, but the inductivity of $X$ is far more concrete than one of $\mathbb{N}$. So, the abstract natural numbers $\mathbb{N}$ can not replace $X$ from axiom of infinity. Оn the other hand I think that if I have $\mathbb{N}$, than I can define $X$ as
$$ X = \bigcup_{n \in \mathbb{N}} P^n(\emptyset), $$ where $P(A) = A \cup \{ A \}$, $P^0(a) = a$ and $P^{\sigma(n)}(a) = P^{n}(P(a))$. So, assuming ZF $-$ INF we have equivalence (NAT) $\iff$ (INF) .
Am I wrong?
Are there any systems of foundations which use axiom similar to (NAT) instead of (INF)? Is (NAT) strictly weaker than (INF)? If this is not the case why not to use (NAT) instead of (INF)?
I think I have seen something like that done by type theorists, but I don't remember exact name of the theory. But, in type theory, It is better to speak about introduction and elimination rules instead of axioms.