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 numbers presented In mathematical logic, the Peano axioms (; [peˈaːno]), also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th-century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of whether number theory is consistent Although the usual natural numbers satisfy the axioms of PA, there are other models as well (called "non-standard models"); the compactness theorem implies that the existence of nonstandard elements cannot be excluded in first-order logic. The upward Löwenheim–Skolem theorem shows that there are nonstandard models of PA of all infinite cardinalities. This is not the case for the original (second-order) Peano axioms, which have only one model, up to isomorphism. This illustrates one way the first-order system PA is weaker than the second-order Peano axioms. When interpreted as a proof within a first-order set theory, such as ZFC, Dedekind's categoricity proof for PA shows that each model of set theory has a unique model of the Peano axioms, up to isomorphism, that embeds as an initial segment of all other models of PA contained within that model of set theory. In the standard model of set theory, this smallest model of PA is the standard model of PA; however, in a nonstandard model of set theory, it may be a nonstandard model of PA. This situation cannot be avoided with any first-order formalization of set theory. It is natural to ask whether a countable nonstandard model can be explicitly constructed. The answer is affirmative as Skolem in 1933 provided an explicit construction of such a nonstandard model. On the other hand, Tennenbaum's theorem, proved in 1959, shows that there is no countable nonstandard model of PA in which either the addition or multiplication operation is computable. This result shows it is difficult to be completely explicit in describing the addition and multiplication operations of a countable nonstandard model of PA. There is only one possible order type of a countable nonstandard model. Letting ω be the order type of the natural numbers, ζ be the order type of the integers, and η be the order type of the rationals, the order type of any countable nonstandard model of PA is ω + ζ·η, which can be visualized as a copy of the natural numbers followed by a dense linear ordering of copies of the integers.

This paper conducts a foundational reassessment of first-order axiomatics by contrasting it with the model-theoretic properties of higher-order logics, particularly second-order logic. First-order logic, characterized by the completeness and compactness theorems, is inherently unable to ensure categorical axiomatizations of fundamental infinite structures, such as the natural numbers or the real numbers. This limitation, demonstrated by the Löwenheim-Skolem theorems, gives rise to non-standard models that are structurally divergent from their intended archetypes. In contrast, second-order logic, by allowing quantification over properties and relations, can categorically define these structures, ensuring that all models are isomorphic. For example, the second-order Peano axioms and the axioms for a complete ordered field uniquely determine the natural numbers and the real numbers, respectively. However, this expressive power comes at the cost of sacrificing completeness; there is no effective proof system that can capture all second-order logical truths. This paper argues that the traditional preference for first-order logic, based on its proof-theoretic tractability, overlooks the profound semantic and descriptive advantages of higher-order logic. By examining the trade-off between deductive completeness and descriptive power, we contend that for foundational purposes where the primary goal is to characterize a unique mathematical structure, the categoricity afforded by highe

In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative to axiomatic set theory as a foundation for much, but not all, of mathematics. A precursor to second-order arithmetic that involves third-order parameters was introduced by David Hilbert and Paul Bernays in their book Grundlagen der Mathemat When M is the usual set of natural numbers with its usual operations, M …