On certain axiomatizations of arithmetic of natural and integer numbers
Summary: The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two different ways. We begin by recalling the classical set \(P\) of axioms of Peano's arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set \(W\) of axioms of this arithmetic (including the primitive notions like: set of natural numbers and relation of inequality) proposed by Witold Wilkosz, a Polish logician, philosopher and mathematician, in 1932. The axioms \(W\) are those of ordered sets without largest element, in which every non-empty set has a least element, and every set bounded from above has a greatest element. We show that \(P\) and \(W\) are equivalent and also that the systems of arithmetic based on \(W\) or on \(P\), are categorical and consistent. There follows a set of intuitive axioms \(PI\) of integers arithmetic, modelled on \(P\) and proposed by B. Iwanuś, as well as a set of axioms \(WI\) of this arithmetic, modelled on the \(W\) axioms, \(PI\) and \(WI\) being also equivalent, categorical and consistent. We also discuss the problem of independence of sets of axioms, which were dealt with earlier.
- A logical system based on rules and its application in teaching mathematical logic
- Categoricity
- Completeness and categoricity: Frege, gödel and model theory
- scientific article; zbMATH DE number 3877141 (Why is no real title available?)
- Introduction to mathematical logic. Translated from the German by Diana Schmidt
- Philosophical and mathematical logic
- Theories of real numbers and interpretability
- Axiomatic (and non-axiomatic) mathematics
- A note on the axiomatisation of real numbers
- scientific article; zbMATH DE number 558391 (Why is no real title available?)
- On Axiomatizability of the Multiplicative Theory of Numbers
- Simple axioms that are obviously true in \(\mathbb{N}\)
- Game with numbers and axioms: Peano-Dedekind systems
- On the Completeness of the Totitives of a Natural Number
- A system of completely independent axioms for the sequence of natural numbers
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- On the (In)Dependence of the Peano Axioms for Natural Numbers
This page was built for publication: On certain axiomatizations of arithmetic of natural and integer numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306641)