Landau's "Foundations of Analysis" - Addition of natural numbers

Something such as the iteration theorem should be proved first:
(P,S,1) is a Peano system
W is a set, $c \in W$, $g : W\rightarrow W.$
Conclusion: There exists a unique function $F: P \rightarrow W$ such that
(a) F(1)=c
(b) F(S(x))=g(F(x)).

One can then apply the iteration theorem to $W=P$ and $g=S$ in order to obtain the existence of a unique binary operation + on $P$ such that
(a) x + 1 = S(x)
(b) x+S(y)=S(x+y) for all $x,y \in P$.

In 1889, Peano published the list of axioms that is now named after him. He thought that his recursive definitions of addition and multiplication were intuitively and obviously consistent, offering no justification at all for it:

He evidently thought that these equations in themselves define the addition and multiplication functions uniquely. He failed to realize the necessity for a proof that there are indeed functions satisfying them. There is therefore a lacuna in Peano's account at just this point.$^{[1]}$

When Landau says that “$x+y$ has not been defined”, he's criticizing Peano for not justifying formally that his recursive definition of $+$ is correct as far as existence and unicity are concerned. More generally, Landau is saying that such recursive definitions should have a rigorous foundation, which is the Recursion Theorem that was published by Dedekind in 1888. This is the theorem that Peano dismissed in his 1889 publication. In fact, Landau himself dismissed it in the first draft of his book:

It is a mark of the significance of Dedekind's achievement that Peano was not the only mathematician of stature to miss the need for it: Landau, for example, omitted the proof from the first draft of his account of arithmetic in 1930 and was saved from error in the published version only by the intervention of a colleague.$^{[1]}$

The statement of the Recursion Theorem is the following.

Recursion Theorem (Dedekind, 1888). Let $A$ be an arbitrary set containing an element $a\in A$, and a given mapping $g:A\to A$ of $A$ into itself. Then there is one and only one mapping $\phi:\mathbb{N}\to A$ with the two following properties: $$ \phi(0)=a\tag{1}, $$ $$ \phi(n+1)=g(\phi(n))\tag{2}. $$

A proof (essentially by induction) of this theorem can be found at pp. 16-17 of [2].

What misled Landau was no doubt the following short but fallacious argument for Dedekind's result. Equation $(1)$ enables us to define $\phi(0)$ uniquely. And if $\phi(n)$ is defined uniquely, equation $(2)$ enables us to define $\phi(n + 1)$ uniquely. Hence by induction the two equations together define $\phi(n)$ uniquely for every natural number $n$. The fallacy in this argument lies in the potential ambiguity of saying that $\phi(n)$ is ‘defined uniquely’ in advance of a proof that the function $\phi$ exists.$^{[1]}$

Since the Recursion Theorem is general, it can be used to justify the definitions of sum and product of natural numbers. However, it doesn't appear in Landau's book. Instead, more direct (and simple) proofs of existence and unicity for $+$ and $\times$ are given. These have been found by Dr Kalmár, as Landau confesses in his preface.

Sources:

[1] Potter, M. (2000), Reason’s Nearest Kin. Oxford: Oxford University Press.

The three excerpts are from pp. 82-83.

[2] H.-D. Ebbinghaus, H. Hermes, K. Lamotke, H. L. S. Orde et J. H. Ewing (1991) Numbers. Graduate texts in mathematics, Springer.

The original version is called Zahlen.