On Certain Axiomatizations of Arithmetic of Natural and Integer Numbers

: The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two di ﬀ erent 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´s, 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.


Introduction
The notion of natural numbers counts amongst the oldest, being one of the most universal abstract notions. Natural numbers belong to the fundamental subject of study of theoretical arithmetic concerned with defining all kinds of numbers, as well as studying their properties and relations between numbers of the same or different kinds. Theoretical arithmetic deals with examination of different types of numbers and their axiomatization, including that of natural numbers and integers. While defining its notions, we base ourselves on second-order logic and set theory.
In the paper, we will discuss some different axiomatizations of arithmetic of natural numbers NA and arithmetic of integer numbers IA (the presentation is based on results originally published in Polish by various authors, and which, as a consequence of their being available only in Polish, are not known among the vast majority of mathematical logicians). Presented theories will be non-elementary second-order theories and alphabet of languages which will assume two sorts of variables: individual variables and variables ranging over sets of individuals, i.e., natural numbers or integers, respectively.
We will start with the original axiomatization of NA proposed by Giuseppe Peano [1] by the set P of axioms on which is based the deductive system PA (the axiomatic non-elementary deductive theory; for short: the system PA) and will compare it with the little known axiomatization of the arithmetic NA by the set W of axioms, which was provided by Witold Wilkosz [2], a Polish logician, mathematician and philosopher of Kraków. The deductive system based on Wilkosz's set W of axioms will be denoted by WA. P1. 0 ∈ N, P2. n* ∈ N, P3. n* 0, P4. m* = n* ⇒ m = n, P5. 0 ∈ X ∧ ∀k ∈ X (k* ∈ X) ⇒ N ⊆ X (the induction principle).
Axioms P1-P4 are elementary ones, whereas axiom P5, called induction axiom, is an axiom of the 2nd order, a non-elementary one. In the first-order Peano arithmetic (elementary arithmetic) which is weaker than PA (see, e.g., [9], chapter II, section 7, chapter III, section 5 and [10], chapter 5), it is reformulated by the induction axiom schema. The induction axiom is applied in inductive proofs of theorems of the form T(n), where n denotes a natural number.
If T(n) with the free variable n is an expression of arithmetic NA and T(0) is its true expression and from the assumption that T(k) is true for k ≥ 0 it follows that T(k*)-its truthfulness for number k*-then T(n) is true for any natural number of set N. Such proofs are based on the following schema of the rule of inductive proof of theorem T(n) for all n: T (0) T(k) ⇒ T (k*) for any k ≥ 0 ------------T(n) for any n ∈ N In proofs of theorems based on the set of axioms P, the following generalized theorems on induction are also made use of: T1. m ∈ X ∧ ∀k ∈ X (m ≤ k ⇒ k* ∈ X) ⇒ ∀n ∈ N (m ≤ n ⇒ n ∈ X), T2. ∀m (∀k < m (k ∈ X) ⇒ m ∈ X)) ⇒ ∀n ∈ N (n ∈ X).
In compliance with T1, if any set of natural numbers to which m belongs satisfies the condition that for each number k of the set, which is not smaller than m, its successor k* also belongs to this set, then to this set belong all the natural numbers not smaller than m. With m = 0, T1 = P5. With theorem T1 corresponds the rule of inductive proof based on the following schema: In compliance with T2, if each natural number m satisfies the condition: if any number smaller than m belongs to a given set of natural numbers, then m also belongs to this set, then each natural number does. With theorem T2 corresponds the rule of inductive proof based on the following schema: The proof of theorem T1 is based on the induction axiom P5 and the elementary theorems of system PA, whereas in the proof of theorem T2 the minimum principle and the elementary theorems of system PA are made use of. The former follows from the induction principle P5 and requires introducing additional definitions into system PA, including the definition of relation of less than, <, and that of non-greater than, ≤.
It can be proved that the induction principle P5, the maximum principle Pmax and the minimum principle Pmin are equivalent to one another on the basis of the elementary theorems of system PA, since the following relations of implication hold: Pmax. In any non-empty set of natural numbers for which there is an upper bound element, there is the greatest number. Symbolically: Pmin. In any non-empty set of natural numbers, there is the least number. Symbolically: Thus, we obtain the first metalogical theorem: MT1. The principles P5, Pmax and Pmin are mutually equivalent on the basis of the elementary theorems of system PA.

Remark.
Each of these non-elementary expressions could then be the only non-elementary axiom of arithmetic of natural numbers NA if-from it and suitably selected elementary axioms-each elementary theorem follows (cf. Słupecki et al. [11] and Sierpiński [6]).
The principles Pmax and Pmin are noted in system PA by means of relations of less than, <, or non-greater than, ≤, but the former is defined by means of the operation of addition +.
The definitions of the relation < and that of ≤ in system PA are the following: The definitions of the operations of addition + and multiplication · are recursive in PA: D1a. m + 0 = 0, b. m + n* = (m + n)*. D2a. m·0 = 0, b. m·n* = m·n + m.
These operations satisfy the well-known properties of a commutative semi-ring with unity (1 = 0*), and it can be proved that the relation < (relation ≤ ) in PA well-orders set N (we differentiate two well-known notions of a relation ordering a set: strict ordering (<) a set and weak ordering (≤) a set).

Wilkosz's Axioms for System WA
The primitive notions in Wilkosz's axiomatic system WA are: the set of natural numbers N and the relation of less than, <. We write Wilkosz's axioms, accepting that the variables m, n, l, k, . . . run over set N, X is a subset of N.
W1. ∃n (n∈ N)-there is a natural number, W2. m n ⇒ m < n ∨ n < m-trichotomy, W3. (m < n ⇒~(n < m))-anti-symmetry of relation <, W4. m < n ∧ n < k ⇒ m < k-transitivity of relation <, W5. m < n ⇒ m, n ∈ N-the field of relation < is set N, W6. ∃k (k ∈ X) ⇒ ∃n∈X∀m∈X (n ≤ m)-the minimum principle, W7. ∃k (k ∈ X) ∧ ∃n∀m∈X (m ≤ n) ⇒ ∃n∈X∀m∈X (m ≤ n)-the maximum principle, W8.~∃m∀n (m n ⇒ n < m)-there is not the greatest number in set N. It is easy to see that in system WA, the relation < well-orders set N (in the sense of strict order). Relation <-a primitive notion in Wilkosz's system WA-is a notion defined in Peano's system PA (see D3), and the primitive notions of system PA, which are not primitive ones in Wilkosz's system WA, are defined in it in the following way: (1) k = 0 ⇔ ∀n (k ≤ n)-0 is the least natural number, (2) k = n* ⇔ k ∈{m ∈ N | n < m} ∧ ∀i ∈{m ∈ N | n < m}(k ≤ i)-n* is the least natural number among numbers greater than n. Relation ≤ less than or equal (not greater) has the following definition: m ≤ n ⇔ m = n ∨ m < n.
It can be proved that the definitions (1) and (2) are correct: there is precisely one natural number k satisfying the definiens of definition (1) and there is precisely one number k (the successor of number n), which satisfies the definiens of definition (2). In the proofs the axioms W2-W4 are used.
Relying on, in Wilkosz's system WA, the definitions of zero and the successor function of a natural number, we can define the operations of addition + and multiplication, in the same way as in system PA (by means of definitions D1a,b and D2a,b).

Equivalence of the Deductive Systems PA and WA
It needs reminding that, in accordance with Tarski's inferential definition of two equivalent sets of sentences of a deductive system (see [12]), two sets of sentences are equivalent if sets of all their consequences (deduced from them sentences) are equal. Thus, most often, for the equivalence of axiomatic deductive system the following definition (cf. [13,14]) is used: (*) Two axiomatic deductive systems are equivalent if the set of axioms and definitions of one of them is equivalent to the set of axioms and definitions of the other system, i.e., if each axiom and definition of one of them is a theorem or definition of the other system and the other way round-each axiom and definition of the other system is a theorem or definition of the first system.
Let us note that (i1) Axioms of system WA are theorems of system PA since W1 follows directly from P1; W8 follows from the fact that in system PA there holds the theorem that n < n* for any n ∈ N, and n* ∈ N (P2); W3-W5 in PA follow from the theorem that N is a set ordered by the relation <; W6 and W7 (principles minimum and maximum, respectively) follow from the induction axiom P5 (see MT1). (i2) Definitions (1) and (2) of zero and the successor of a natural number in WA are theorems in system PA. (i3) Definitions of the operations addition and multiplication in system WA are the same as in system PA. (i4) Each axiom and definition of system WA is a theorem or definition in system PA.
On the other hand (j1) Axioms of system PA are theorems of system WA, since from the correctness of definitions (1) and (2) in WA, in particular axioms P1 and P2 follow; also P3 is a theorem in WA, because if it would be possible that n* = 0, then it would follow from (1) that n* ≤ n and from (2) that n < n*, and hence that 0 ≤ n and n < 0, that is on the basis of W3:~0 < n and n = 0, that is 0 < 0, which leads to contradiction according to W3; next, P4 follows from (2) and from the property of relation <, as one ordering set N. Axiom P5-the induction principle follows from those of maximum and minimum (W7 and W6; see MT1). (j2) Definition D3 of relation < in PA can be derived from axioms and definitions of system WA.
(j3) Each axiom and definition of system PA is a theorem of system WA.
From (i4) and (j3), in compliance with (*), we obtain the following metatheorem: MT2. The systems of PA and WA are equivalent. This equivalence was sketched in the booklet by Wilkosz [2] under the title Arytmetyka liczb całkowitych (The Arithmetic of Integers). Equivalence of Wilkosz's and Peano's systems was the subject of my MA thesis.

Independence of Axioms in Systems PA and WA
As is well known from Gödel's first incompleteness theorem given in 1931 [15], no finite set of axioms of natural numbers is complete, or even each infinite, countable set of axioms of arithmetic is incomplete. There arises the problem, however, whether it is possible to reduce the number of axioms of PA and WA without depleting the set of theorems which can be proved about natural numbers.
It can be shown that MT3a. The set of axioms of PA arithmetic system is independent (Sierpiński [6]). b. The set of axioms of WA system is dependent and can be reduced to the set: {W1, W3, W5, W6, W7, W8}. Axiom W2 follows from axiom W6, while axiom W4 follows from axioms W3, W5 and W6. Hence, it follows that the axioms of the theory of well-ordered sets in regard to relation < can be based on axioms W3, W5 and W6, while Wilkosz's system WA can be based on the axioms: To prove independence of the axioms one can, as it is known, use the method of interpretation, which consists in finding such an interpretation of primitive terms of the given system that makes all the axioms, apart from one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai is independent from the others.

Categoricity of Arithmetic Systems PA and WA
Let us recall the definition of the notion of categoricity (see, e.g., [16][17][18]): (**) A deductive system is categorical if and only if all its models are isomorphic. As we mentioned, PA and WA as second-order, non-elementary systems, as well as elementary Peanos arithmetic, are not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter 8).
A model of Peano's arithmetic system PA is each triple <N, 0, S > assigned to the triple <N, 0, * > of primitive terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which satisfies Peano's axioms P1-P5.
A model of Wilkosz's arithmetic system WA is each tuple <N, To prove independence of the axioms one can, as it is known, use the method of interpretation, which consists in finding such an interpretation of primitive terms of the given system that makes all the axioms, apart from one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai is independent from the others.

Categoricity of Arithmetic Systems PA and WA
Let us recall the definition of the notion of categoricity (see, e.g., [16][17][18]): (**) A deductive system is categorical if and only if all its models are isomorphic. As we mentioned, PA and WA as second-order, non-elementary systems, as well as elementary Peanos arithmetic, are not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter 8).
A model of Peano's arithmetic system PA is each triple <N, 0, S > assigned to the triple <N, 0, * > of primitive terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which satisfies Peano's axioms P1-P5.
(m2) Two models of WA: Dedekind already in [7] proved that (m3) Each two models of arithmetic system PA are isomorphic.
In the book by Słupecki et al. [11], there is a proof that (m2) Each two models of arithmetic system WA are isomorphic.
> assigned to the tuple < N, < > of primitive terms of WA system, where N is an infinite, countable set and To prove independence of the axioms one can, as it is known, use the method of interpretation, which consists in finding such an interpretation of primitive terms of the given system that makes all the axioms, apart from one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai is independent from the others.

Categoricity of Arithmetic Systems PA and WA
Let us recall the definition of the notion of categoricity (see, e.g., [16][17][18]): (**) A deductive system is categorical if and only if all its models are isomorphic. As we mentioned, PA and WA as second-order, non-elementary systems, as well as elementary Peanos arithmetic, are not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter 8).
A model of Peano's arithmetic system PA is each triple <N, 0, S > assigned to the triple <N, 0, * > of primitive terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which satisfies Peano's axioms P1-P5.
In the book by Słupecki et al. [11], there is a proof that (m2) Each two models of arithmetic system WA are isomorphic. there is bijection f: N 1 → N 2 such that f is homomorphism from P 1 to P 2 , that is f(0 1 ) = 0 2 and f(S 1 (m)) = S 2 (f(m)) for any m ∈ N 1 . (m2) Two models of WA: W 1 = <N 1 , ~ (n < m))-asymmetry of relation < in N, X∀m∈X (n ≤ m)-the minimum principle, m∈X (m ≤ n)  ∃n∈X∀m∈X (m ≤ n)-the maximum principle.
ndence of the axioms one can, as it is known, use the method of interpretation, ing such an interpretation of primitive terms of the given system that makes all one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai he others.
hmetic Systems PA and WA efinition of the notion of categoricity (see, e.g., [16][17][18]): system is categorical if and only if all its models are isomorphic.
, PA and WA as second-order, non-elementary systems, as well as elementary not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter no's arithmetic system PA is each triple <N, 0, S > assigned to the triple e terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which s P1-P5. osz's arithmetic system WA is each tuple <N, Հ > assigned to the tuple < N, < > WA system, where N is an infinite, countable set and Հ a binary relation with isfies Wilkosz's axioms W1-W8 (W1′-W5′).
of WA: W1 = <N1, Հ1 > and W2 = <N2, Հ 2 > are isomorphic if and only if there is 2 being homomorphism from W1 to W2, that is f(n) for any m, n ∈ N1. y in [7] proved that els of arithmetic system PA are isomorphic.
upecki et al. [11], there is a proof that els of arithmetic system WA are isomorphic.
W3.' ∀m∀n (m < n ⇔ ~ (n < m))-asymmetry of relation < in N, W4.' ∃k (k ∈ X)  ∃n∈X∀m∈X (n ≤ m)-the minimum principle, To prove independence of the axioms one can, as it is known, use the method of interpretation, which consists in finding such an interpretation of primitive terms of the given system that makes all the axioms, apart from one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai is independent from the others.

Categoricity of Arithmetic Systems PA and WA
Let us recall the definition of the notion of categoricity (see, e.g., [16][17][18]): (**) A deductive system is categorical if and only if all its models are isomorphic. As we mentioned, PA and WA as second-order, non-elementary systems, as well as elementary Peanos arithmetic, are not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter 8).
A model of Peano's arithmetic system PA is each triple <N, 0, S > assigned to the triple <N, 0, * > of primitive terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which satisfies Peano's axioms P1-P5.
A model of Wilkosz's arithmetic system WA is each tuple <N, Հ > assigned to the tuple < N, < > of primitive terms of WA system, where N is an infinite, countable set and Հ a binary relation with the field N, which satisfies Wilkosz's axioms W1-W8 (W1′-W5′). Dedekind already in [7] proved that (m3) Each two models of arithmetic system PA are isomorphic.
In the book by Słupecki et al. [11], there is a proof that (m2) Each two models of arithmetic system WA are isomorphic.
To prove independence of the axioms one can, as it is known, use the method of interpretation, which consists in finding such an interpretation of primitive terms of the given system that makes all the axioms, apart from one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai is independent from the others.

Categoricity of Arithmetic Systems PA and WA
Let us recall the definition of the notion of categoricity (see, e.g., [16][17][18]): (**) A deductive system is categorical if and only if all its models are isomorphic. As we mentioned, PA and WA as second-order, non-elementary systems, as well as elementary Peanos arithmetic, are not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter 8).
A model of Peano's arithmetic system PA is each triple <N, 0, S > assigned to the triple <N, 0, * > of primitive terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which satisfies Peano's axioms P1-P5.
A model of Wilkosz's arithmetic system WA is each tuple <N, Հ > assigned to the tuple < N, < > of primitive terms of WA system, where N is an infinite, countable set and Հ a binary relation with the field N, which satisfies Wilkosz's axioms W1-W8 (W1′-W5′). Dedekind already in [7] proved that (m3) Each two models of arithmetic system PA are isomorphic.
In the book by Słupecki et al. [11], there is a proof that (m2) Each two models of arithmetic system WA are isomorphic.
W2.' ∀m∃n (m ≤ n)-in set N there is not the greatest number, W3.' ∀m∀n (m < n ⇔ ~ (n < m))-asymmetry of relation < in N, W4.' ∃k (k ∈ X)  ∃n∈X∀m∈X (n ≤ m)-the minimum principle, To prove independence of the axioms one can, as it is known, use the method of interpretation, which consists in finding such an interpretation of primitive terms of the given system that makes all the axioms, apart from one, e.g., Ai, true at the interpretation. If we find it, then the given axiom Ai is independent from the others.

Categoricity of Arithmetic Systems PA and WA
Let us recall the definition of the notion of categoricity (see, e.g., [16][17][18]): (**) A deductive system is categorical if and only if all its models are isomorphic. As we mentioned, PA and WA as second-order, non-elementary systems, as well as elementary Peanos arithmetic, are not complete, yet we can show that they are categorical (cf. [7,10,18,19], chapter 8).
A model of Peano's arithmetic system PA is each triple <N, 0, S > assigned to the triple <N, 0, * > of primitive terms of system PA, where N is an infinite set, 0 ∈N, and S: N → N, which satisfies Peano's axioms P1-P5.
A model of Wilkosz's arithmetic system WA is each tuple <N, Հ > assigned to the tuple < N, < > of primitive terms of WA system, where N is an infinite, countable set and Հ a binary relation with the field N, which satisfies Wilkosz's axioms W1-W8 (W1′-W5′). Dedekind already in [7] proved that (m3) Each two models of arithmetic system PA are isomorphic.
In the book by Słupecki et al. [11], there is a proof that (m2) Each two models of arithmetic system WA are isomorphic. 2 f(n) for any m, n ∈ N 1 . Dedekind already in [7] proved that (m3) Each two models of arithmetic system PA are isomorphic. In the book by Słupecki et al. [11], there is a proof that (m4) Each two models of arithmetic system WA are isomorphic.
Hence, we have the metalogic corollary: MT4. The deductive systems PA and WA of natural numbers arithmetic NA are categorical; they are in power ℵ 0 , so they are aleph-null categorical systems.
Thus, Peano's and Wilkosz's second-order systems have only one model, up to isomorphism. This is not so when we consider the systems of arithmetic of natural numbers as systems (elementary theories) of the first-order. According to the upward Löwenheim-Skolem's theorem, there are non-standard models of Peano's elementary arithmetic system of all infinite cardinality (see e.g., [9], chapter III, section 5, [20], chapterVI).

Set-Theoretical Models for PA and WA
Peano's arithmetic possesses a "natural" set-theoretical model deriving from Frege. Let N be an infinite set of all cardinal numbers of finite subsets of any (infinite) set U, i.e., where Fin(U) is the smallest family of sets to which the empty set ∅ belongs and which is closed under the relation S: The formal definition of the set Fin (U) is the following: From (mP) and (mW) we get two next metalogic corollaries: MT5. PA and WA systems are consistent.
(since it follows from the theorem of categoricity (MT4) that all theorems of these systems are true, because they are true in each model of these systems).
MT6. Systems PA and WA are (treated as) fragments of set theory. As we know, the theorem MT6 is of great importance to studies on the foundations of mathematics.

Simple Axiomatizations of Arithmetic of Integers, Based on Systems PA and WA
Axiomatic systems for integer arithmetic IA are most often based on notions of operations of addition and multiplication defined on the set I of integers. In this part of the work, we will give an axiomatization of integer arithmetic IA modelled on the systems PA and WA respectively for the arithmetic of natural numbers NA, extending these systems accordingly and comparing them with Sierpiński's system SIA [6], including addition and multiplication as its primitive notions.

Iwanuś's Axioms for IA, Modelled on the Axioms of System PA
We will give here two systems of axioms proposed by Bolesław Iwanuś [3] for IA system. They are interesting due to their intuitive character. The first system based on them will be denoted as P 1 IA, and the other one-P 2 IA. The primitive notions of P 1 IA are: set N* of all non-negative integers, set *N of all non-positive numbers, integer 0 and two unary operations in N*∪*N of successor and predecessor of an integer. The successor and the predecessor of integer i will be denoted as i* and *i, respectively. In the intuitive meaning, i* = i + 1 and *i = i -1.
We assume that i, j, k, l, . . . are variables ranging over the set N*∪*N, while variables A, B, C . . . range over the subsets of this set.
3.1.1. Axioms of System P 1 IA Are the Symmetric Axioms for Numbers of the Sets N* and *N: A5. i ∈ N*∪*N ⇒ *(i*) = i = (*i)*. Axioms A*1-A*3 and *A1-*A3 are modelled on those of Peano (P1-P3). Axioms A*4 and *A4 correspond to that of induction P5. Axiom A5 establishes relations between the successor and the predecessor operation and does not allow identification of these notions with each other, nor identification of sets N* and *N. The set I of all integers is defined as follows: The counterparts of Peano's axiom P4 i, j ∈ N* ∧ i* = j* ⇒ i = j and i, j ∈ *N ∧ *i = *j ⇒ i = j are direct consequences of A5.
It is easy to notice that with the assumption that the set I of integers is a primitive notion of the system of arithmetic IA, the symmetrical axioms of P 1 IA can be replaced by weaker ones, deriving from Słupecki in [11]: A1. 0 ∈ I, A2. i ∈ I ⇒ i*,*i ∈ I, A3. i ∈ I ⇒ i* i, A4, A ⊆ I ∧ 0 ∈ A ∧∀i ∈ A (i*, *i ∈ A) ⇒ I =A, A5. i ∈ I ⇒ (*i)* = *(i*) = i, In this system, there are theorems that, to a certain extent, are similar to Peano's axiom A3, which are in force: In Iwanuś's system P 1 IA, there are the following definitions of the operations of: addition +, subtraction − and multiplication: It is assumed that 1 = 0* and it is proved that In proofs of the theorems of system P 1 IA the following meta-theorem is made use of: MT7. If α is an expression of system P 1 IA, in which-beside primitive notions-there are exclusively the defined terms + and . , then α is a theorem of this system if expression α d , dual with respect to α, is a thesis of this system; expression α d is dual to α, when the terms: The inequality relation less-than, <, in I is determined by the following definition added to P 1 IA:

Remark 2.
In system P 1 IA, one can prove all the theorems of arithmetic of integers IA relating to relation <.

The Other System of Arithmetic of Integers Built by Iwanuś [3] and Modelled on System PA
The system is denoted by P 2 IA and based only on the following three primitive notions: set I of all integers, the function of successor * and number 0.
The following formulas are the axioms of system P 2 IA: Axiom I3 assumes the existence of a certain subset of set I, about which-on the base of the above accepted set of axioms-it can be proved that it is isomorphic due to function * to the set of all natural numbers. Axiom I4 is a postulate of induction in the set of integers.
If we introduce into system P 2 IA still one more primitive term N (as a name of a subset of set I which is isomorphic to the set of natural numbers), then axiom I3 can be substituted with the following set of axioms: Axiom I3 is weaker than axioms I3a-d, because I3 follows from these axioms, although not all of I3a-d follow from I3.
In P 2 IA system the primitive notions of P 1 IA system are defined in the following way: All the remaining definitions of system P 1 IA are the same in system P 2 IA. Iwanuś proves that MT8. Systems P 1 IA and P 2 IA are equivalent. B. Iwanuś also proves in [3] that these systems are equivalent to Sierpiński's system of arithmetic of integers SIA [6], based on primitive notions: the set I, operations of addition + and multiplication ·, zero 0, one 1 and the set N*, satisfying the axioms of the ring without zero divisors: Definitions of primitive terms of system P 1 IA are introduced into system SIA as follows: Definition D I 4 of relation < of system P 1 IA is the same as in system SIA. MT9. System P 1 IA (P 2 IA system), modelled on Peano's system of natural numbers arithmetic PA, and system SIA are equivalent.

Axioms of the System of Integer Arithmetic WIA Modelled on Wilkosz's System WA
The primitive notions of the system of integer arithmetic WIA, modelled on Wilkosz's system WA, are the following: set I of all integers, integer zero 0 and less-than relation < in set I. The relation of weak inequality ≤ is determined by the definition (i, j, k, . . . run over I): D0. i ≤ j ⇔ i < j ∨ i = j. The axioms of system WIA which are presented by Wybraniec-Skardowska [4,5] are the following expressions: W 3. i, j ∈ I ⇒ (i < j ⇒~(j < i)), W 4. i, j, k ∈ I ∧ (i < j ∧ j < k) ⇒ i < k, W 5. ∀i ∈ I ∃j ∈ I (i < j) -in I there is not the greatest number, W 6. ∀i ∈ I ∃j ∈ I (j < i) -in I there is not the smallest number, According to W'7, in each non-empty set of integers, which has a lower bound, there is the smallest number, while, according to W'8, in each non-empty set of integers, which has an upper bound, there exists the greatest number.
The content of axioms W'7 and W'8 is close to the principles of minimum and maximum of arithmetic WA. The axioms of system WIA state that relation < orders set I, yet do not state that it well-orders the set.
In system WIA one can define the notion of successor and that of predecessor of an integer as well as the notions of sets N* and *N, which are primitive notions in Iwanuś's system P 1 IA. Let us note first that in system WIA it is possible to prove the theorem: A ⊆ I ∧ ∃i ∈ A ∧ ∃i ∈ I∀j ∈ A (i < j) ⇒ ∃ 1 k ∈ A∀j ∈ A (k ≤ j). (1) Condition (1) allows introducing correctly the definition of minimum in set A: D W 1. A ⊆ I ∧ ∃i ∈ A ∧ ∃i ∈ I∀j ∈ A (i ≤ j) ⇒ (k = min (A) ⇔ k ∈ A ∧ ∀j ∈ A (k ≤ j)). It follows from Condition (1) and D W 1 that there is a unique minimum, min (A), when A ⊆ I, A ∅ and set A has a lower bound.
The successor of an integer i is introduced by means of the definition: D W 2. i* = min(G(i)) -i* is the smallest integer which is greater than i. D W 3. N* = {i ∈ I | 0 ≤ i}. The following corollary which is dual to Condition (1): A ⊆ I ∧ ∃i ∈ A ∧ ∃i ∈ I∀j ∈ A (j < i) ⇒ ∃ 1 k ∈ A∀j ∈ A (j ≤ k).
permits introducing the definition of maximum of a certain set of integers: D W 4. A ⊆ I ∧ ∃i ∈ A ∧ ∃i ∈ I∀j ∈ A (j ≤ i) ⇒ (k = max(A) ⇔ k ∈ A ∧∀j ∈ A (j ≤ k)). Let L(i) = {j∈ I | j < i}. Hence L(i) ∅ (see W'6) and ∃ 1 k ∈ L(i)∀j ∈ L(i) (j ≤ k) (see Condition (3)) then on the basis of D W 4 the predecessor of integer i is defined as the greatest integer less than i, that is D W 5. *i = max(L(i)), and set *N is defined as follows D W 6. *N = {i ∈ I | i ≤ 0}.

Remark 3.
With the definitions of the primitive notions of system P 1 IA, given in system WIA, all the axioms and definitions P 1 IA become theorems of definitions in system WIA.
Let us also note that the built systems of integer arithmetic, modelled on the systems of arithmetic of natural numbers of Peano and Wilkosz, were treated as respective extensions of the latter, since the set of natural numbers N in Peano's system PA, with the function of successor * and zero 0 ∈ N, is isomorphic with a proper subset of set I of integers in the system of integer arithmetic P 1 IA, that is to set N*⊂ I, function * in N* and zero 0 ∈ N*, whereas the set of natural numbers N in Wilkosz's system of natural numbers arithmetic WA, with zero 0 ∈ N and relation less-than < in N, is isomorphic with the proper subset N* ⊂ I in the system of integers arithmetic WIA, with zero 0 ∈ N* and relation < in N*. It follows from the remark above that arithmetic of integers can be defined not only through giving a set of axioms, but as an extension of arithmetic of natural numbers by the well-known method of construction, as well. So, it follows from MT6 that both integer systems P 1 IA (P 2 IA) and WIA can be treated as fragments of set theory.
Funding: This research received no external funding.