{'fraction_non_alphanumeric': 0.039870947183940096, 'fraction_numerical': 0.004978889508484028, 'mean_word_length': 4.200289975144988, 'pattern_counts': {'":': 0, '<': 10, '<?xml version=': 0, '>': 9, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 8, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Finite Arithmetic Axiomatization for the Basis of Hyperrational Non-Standard Analysis

: The standard elementary number theory is not a ﬁnite axiomatic system due to the presence of the induction axiom scheme. Absence of a ﬁnite axiomatic system is not an obstacle for most tasks, but may be considered as imperfect since the induction is strongly associated with the presence of set theory external to the axiomatic system. Also in the case of logic approach to the artiﬁcial intelligence problems presence of a ﬁnite number of basic axioms and states is important. Axiomatic hyperrational analysis is the axiomatic system of hyperrational number ﬁeld. The properties of hyperrational numbers and functions allow them to be used to model real numbers and functions of classical elementary mathematical analysis. However hyperrational analysis is based on well-known non-ﬁnite hyperarithmetic axiomatics. In the article we present a new ﬁnite ﬁrst-order arithmetic theory designed to be the basis of the axiomatic hyperrational analysis and, as a consequence, mathematical analysis in general as a basis for all mathematical application including AI problems. It is shown that this axiomatics meet the requirements, i.e., it could be used as the basis of an axiomatic hyperrational analysis. The article in effect completes the foundation of axiomatic hyperrational analysis without calling in an arithmetic extension, since in the framework of the presented theory inﬁnite numbers arise without invoking any new constants. The proposed system describes a class of numbers in which inﬁnite numbers exist as natural objects of the theory itself. We also do not appeal to any “enveloping” set theory.


Introduction
The common elementary number theory, the axiomatic theory of arithmetic, is not a finite system of axioms due to the presence of an induction axiom scheme. Although the absence of a finite axiomatic system is not an obstacle for most problems, according to the authors, such axiomatic system could be considered as subject of discussion because the induction is closely related to the presence of a set theory external to the axiomatic theory under study. Also, in the logical approach to the artificial intelligence (AI) problems, it is important to have a finite number of basic states and axioms, on the basis of which the formalization and solution of the tasks are constructed.
We introduce a finite axiomatic system of arithmetic, designed to be the basis of axiomatic hyperrational non-standard analysis and, as a consequence, mathematical analysis in a general. This is important since the analysis is the basis of all mathematical applications including AI problems. The finiteness of the number of axioms and the absence of the induction axiom make the proposed system similar to R. Robinson's arithmetic [1]. However, we postulate the commutativity of operations, which are generally unprovable in Robinson's arithmetic. Of course, any axiomatic system is also interesting from a purely logical point of view. However in this paper, we do not conduct a complete study of the

Basic Notation and Deductive System
We have adopted the following notations in the article. Capital calligraphic letters denote formulas of the first-order predicate calculus. The Greek ones are for lists of formulas. Following classic Gentzen notation, the −→ symbol is used as the separator of sequent's antecedent and succedent, symbols ⊃ and ≡ are for implication and equivalence correspondingly. The symbol is used to denote the fact of a theorem, i.e., the fact that a sequent is derivable or a formula is provable in a theory. Theories are represented with capital boldface letters. We consider only finite theories. So S indicates that the sequent S is derivable in the deductive system used, and T A means that in theory T, the formula A is proved (witch is the same as T −→ A), i.e., A is the theorem of the theory T. The character := is used to define notations or reductions (for formulas, predicates, etc.).
[A] u t denotes a (syntactic) result of substituting all free occurrences of a variable u to the term t, supposing that the term t is free for the variable u in A. If x is the only free variable of A, we denote it as A(x). We also use infix notation for binary predicate and binary function symbols.
Note that the authors avoid frequently used designations such as =⇒, ⇐⇒, |=, which are related to semantics (the model theory), since, according to the authors, one should clearly distinguish between the syntactic approach (derivability, provability) and the semantic one, associated with the concept of truth, which requires the involvement of an external set theory.
Here is a list of inference rules. This inference system borrowed by the author from [12], where its completeness and semantic validity are proved. A similar deduction system was initially listed in [13].
In the (∀L) and (∃R), the term t should be free for the variable x; in the rules (∀R) and (∃L), variable y must not occur free anywhere in the lower sequents.

Axioms List
The formal language of the finite arithmetic is the first-order predicate calculus language, whose signature contains the constant "zero" denoted as 0, the equality binary predicate denoted by common symbol = and functional symbols for addition and multiplication, + and · correspondingly. To describe a formalized theory, the formal language of predicate calculus is used, described, for example, in [13,14]. We list the following formulas to be the axioms of finite arithmetic.

Preliminary Results
Lemma 1. The following statements are valid.

1.
If T ∀xA for any theory T, then for any term t free for the variable Since the rule ( ∀R) is valid, then from sequent A −→ ∀xA provability we immediately have provability of (A −→ A), i.e., formula A is the theorem of finite arithmetic.

3.
Applying ( ∀R) the required number of times to each sequent got from axioms A k , k = 1, 2, . . . , 21 we get the following finite arithmetic theorems.

4.
Considering the first statement, all formulas obtained from the formulas B 1 -B 21 by substituting arbitrary terms instead of free variables are theorems of finite arithmetic. In particular, any designation can be used since it was possible to proceed from any designations of bound variables when applying the backward rule of the universal quantifier of exclusion.

5.
We have an axiom x t for a term t free for variable x. Using (∃R) we obtain Let T ∃xA. Then, extending the theory T language by Skolem's constant z and the theory itself by an axiom [A] x z we can get a conservative Skolem's extension of the theory T. This trick can be used in the proof, returning afterwards to the original theory by eliminating z as a free for substitution variable.
The above lemma is technical. The facts noted in it facilitate formal proofs, allowing not to give a complete sequential inference.

Properties of the Order
Let us define predicates x ≤ y := ∃z(x + z = y) and x < y := x ≤ y & ¬(x = y) and prove the natural properties of order in the finite arithmetic. Theorem 1. The following formulas are theorems of the theory A.

1.
∀x Proof. The first part of the theorem is proved trivially. To prove the second point, it is required to check the derivability of the sequent Here is the restoration of the inference (from bottom to top): We prove the last sequent in a following way.
is got. From the axiom of addition's associativity B 10 the sequent is derived. From two last sequent by (cut) we get the sequent

Now, using the equality symmetry
and the cut rule we get Applying (∃R) to the last sequent we obtain i.e., the required sequent. Then take into account the sequent It is an axiom due to A 20 . Using rules ( ∀R) we get So, for some z, possibly a constants from the Skolem's extension, of the theory A, the sequent Applying consequently (∃R): In other words, the sequent is derivable. From the last sequent by (∨R) we get Applying consequently (∀R): From this result, statement 4 follows easily.
The proof of the third statement is given by reasoning without a complete presentation of the derivation of the sequents. If x ≤ y and y ≤ x then for some u, v we have

It is clear that
i.e., the sequent is derivable. Then for some z, perhaps from Skolem's extension of finite arithmetic, we have x + z = x. Suppose that ¬(z = 0), then z = w for some w and hence i.e., x ≤ x. On the other hand it is clear that x = (x + 0) = x + 0 , i.e., x < x . The last two inequalities obtained contradict the statement 4.
is derivable. In the same way, the derivability of the sequent is proven. Excluding from this sequents' succedents the implication ( & & ⊃R) and, then, applying to the derived sequents (& R) we get the derivability of the sequent which completes the proof of the fifth statement of the theorem. The remaining statements are proved similarly.
The proved theorem describes the properties of the order and its consistency with algebraic operations. This result means that the objects represented by the axioms of the finite arithmetic A satisfy the usual properties of natural numbers.

Definable Sets and Functions
The concept of a set makes sense only in axiomatic set theory. Since, in our context, we do not assume the existence of an "enveloping" set theory, the usage of the term "set" seems inappropriate. However, almost all modern mathematics is set-theoretic and set-theoretic terms, and often even the terms and notations of "Cantor's paradise" (the so-called naive set theory) are so ingrained that it seems inconceivable to present mathematical facts without them. In addition, these concepts are convenient, and their use significantly shortens the presentation itself, so it often makes it easier to understand. The author's education and a number of his works are also set-theoretic, but when presenting the foundations of both mathematics and its main part, the elementary analysis, the set-theoretic approach should be avoided. But, paying tribute to what was said earlier and considering the affection of most mathematicians to the term "set", we present a specific set theory. This set theory is internal to the finite arithmetic.
In this theory a set is understood as a property of terms of the finite arithmetic language. But, since these properties are not all-encompassing but are described by quite specific formulas, theoretical and multiple paradoxes do not arise. Here the situation is similar to considering formulas with bounded quantifiers since from the point of view of axiomatic set theory, all formulas are determined precisely by bounded quantifiers. That is why we are talking about definable sets: our sets are determined using finite arithmetic. This situation is analogous to the one that arises in A. Robinson's classical non-standard analysis [15], where internal sets appear (those that are elements of a non-standard universe). Opposite to them are external sets, they lie outside the universe and cannot be defined inside it. To work with both internal and external sets, it is necessary to expand the existing theories by adding special predicates and functional symbols. Looking ahead, we note that the author also resorts to extending the language of finite arithmetic to describe some properties inherent in natural numbers. In non-standard set-theoretic analysis, this role is played, for example, by Nelson's internal set theory [8].

Definable Sets
Definition 1. Let A be a formula of some predicate calculus theory (here the A theory is considered but corresponding notions could be introduced for any arbitrary first-order predicate theory). We say that the formula A defines the set A if ∃xA. Moreover, we will say that for some term t that is free for variable x substitution in A, t ∈ A takes place if and only if [A] x t . We also say that t is an element of set A. In this case, set A is called definable by the formula A. In this case, we write For example, consider the set of all natural values N, an analogue of the set of natural numbers in set-theoretic analysis. This set is defined by the formula N := x = x. In other words, n ∈ N if and only if n = n. Note that the definition by the formula x = x does not mean the equality of two objects, but the provability within the framework of a certain axiomatic system of this equality. Therefore, in different axiomatic theories, the same formula will define different from the Cantor's paradise point of view sets.
Let us now prove those equivalent formulas define equal sets.
x u is derived, to which we apply (∃R). Thus we have that the sequent A, [A] x u −→ ∃xB is derivable. The rule was applied correctly due to the choice of u. For the same reason, the rule (∀L) applies to the resulting sequent. Therefore, the derivable sequent A, ∃xA −→ ∃xB, to which we apply the rule (⊃ R) and get that A −→ ∃xA ⊃ ∃xB. The opposite implication is proved similarly, which allows us to conclude by (≡ R) that ∃xA ≡ ∃xB.
The proved theorem allows us to introduce the concept of equality of sets.

Definition 2. For (definable) sets A and B, we say A = B if and only if A ≡ B.
In other words, as in the common set theory, two sets are equal if and only if they consist of the same elements. Similarly, introducing the concept of a subset, we obtain that sets are equal if and only if this sets are subsets of each other.

Definition 3. For definable sets A and B, we say that A ⊂ B if and only if from a ∈
The following theorem could be easily proved.
is also derivable. The opposite implication is proved similarly.
Considering the above, the following definition of an empty set is correct, and the empty set is uniquely defined. Proof. We will not give all set-theoretic formulas, but restrict ourselves to proving some. For example, the validity of one of de Morgan's laws is obtained by constructing the inference of the sequent The derivability of this sequent is equivalent to the derivability of the following two sequents Then consequently applying the rule (& R) we obtain the required sequent. The inference of the second sequent is constructed similarly.
Note that the presence of axioms of the finite arithmetic in the antecedent of sequents is not necessary. That is, the corresponding properties are derivable without any theory, they are predicate tautologies. In other words, in the presence of an enveloping set theory, set-theoretic formulas for definable sets are absolute, independent of the theory.

Definable Functions
Definition 6. By a definable function f we mean a formula F in the language of the theory A with the following properties: If ∃y[F ] uv xy , then we denote y = f (x). At the same time, the case of several variables is not excluded. This will be the case when a tuple of free variables of the formula F is treated as the single variable y.
It is easy to see that the following functions are definable and defined everywhere.
where t is a some term; 4.
f (x) = rem(x, y) (remainder of a division x to y); 5.
Functions f (x, y) = x − y and g(x, y) = x y are definable but not everywhere defined.

Algorithmically Reachable Natural Numbers
It is apparent that in the Zermelo-Fraenkel set theory, the set of natural numbers (i.e., the set of finite ordinals ω) is a model of finite arithmetic and even formalized number theory [3]. Earlier, we have introduced the set N defined by the formula n = n. This set is designed to be an analogue of natural numbers in the finite arithmetic. It is apparent that the class N does not represent all the properties of natural numbers, so we call these "defective" objects not numbers but values.
The axioms of finite arithmetic guarantee that the addition of unity function x = x + 1 is defined on the set of all natural values. On the other hand, if n is a non-zero natural value, there is such m that n = m . Moreover, this element n is uniquely determined because on B 4 .
Consider for any non-zero n ∈ N that the unique element m ∈ N, such then n = m . If m = 0, the procedure is considered as finished. If m = 0, then there exists a unique element k ∈ N such then m = k , i.e., n = k . In this case, again, if k = 0, the procedure is finished, otherwise it is continued. There arises a natural question, will this procedure ever stop? In other words, will zero be reached at some step?
The presence of the induction axiom in classical number theory allows us to prove that the process will stop and, therefore, any natural number has the form 0 ··· . In the case of finite arithmetic, this cannot be guaranteed. Therefore, there is a class of those natural values with the form 0 ··· . Clearly this class is not a definable set within the framework of the theory of finite arithmetic. On the other hand, the sum and product of values of the form 0 ··· is also a value of the same form. However, as follows from the impossibility of defining this form using finite arithmetic, it is impossible to prove this within the theory A. The situation here exactly represents the fact that the set of natural numbers in the non-standard universe of A. Robinson is external.

Definition 7.
The theory HA, the union of A and axioms N 0 -N 4 , is called finite hyperarithmetic. In the theory HA one could define a set of all natural values N and its subset N containing only finite values. From the set-theoretical point of view, the relationship between these sets is the same as between the set of hypernatural numbers and the set of (finite) natural numbers.
The axioms N 1 -N 4 guarantee that the set of finite numbers is closed under all arithmetic operations.
From the axioms N 2 , N 3 the following statement instantly follows. It is also easy to prove Theorem 6. ∀x∀y(N(x) & ¬N(y) ⊃ x < y).
Proof. Apparently there cannot be x + z = y and y + z = x simultaneously since this contradicts the belonging of x and y to different classes. On the other hand, since for the same reason, there cannot be x = y due to the trichotomy of x < y.
Note that if x = 0 is finite, then its predecessor is also finite, which is either a zero value or has a predecessor. So we get the chain x = x 1 + 1 = x 2 + 2 = . . . x k + k. Since x is finite, every x i in this chain is finite. And, since zero is a finite number without a predecessor, this chain will terminate at a step m such that x m = 0. In other words, finite numbers are reachable. Infinite numbers are unreachable. Here we identified the concept of a step with the addition of one; we brought the concept of finiteness from the external world.
Thus, from the external world point of view, there is a class N of all objects having the properties of natural numbers. It has a subclass of finite numbers distinguished as a class of objects satisfying the property N. A complementary class represents those numbers that do not exist with the usual introduction of natural numbers. We owe its possible appearance to the absence of an induction axiom scheme, with the help of which it is proved that all numbers are reachable. The non-emptiness of the class of infinite numbers, on the one hand, is a payment for the finiteness of the system of axioms, and on the other hand, a bonus that allows, by extending finite hyperarithmetic to the theory of hyperrational numbers, to obtain infinitesimal as actual objects of analysis, as is done in [6].
The notion of reachability can also be described from the point of view of the existence of some algorithm , which, in a certain number of steps, matched in this context the act of adding one (taking a follower), allows one to construct a reachable number. Thus, the class of finite numbers is a class of all numbers that can be constructed using some algorithm. This makes our theory close to a constructive conception of the natural number [16].

Class N Structure
Theorem 7. For any natural values x and y if x > y, then there exists a unique z such then x + z = y.
The existence is followed from the inequality definition, and the uniqueness is obtained from B 21 .

Definition 9.
So the function f of dom f = { x, y : x > y} is definable. For pairs from complementary to dom f set we put f (x, y) = 0. Let us denote it as x y = f (x, y) and call it pseudosubstraction.
The following statement could be easily proven.

Proof.
To the proof, note that if x y = k > 0, then it is clear that y + k = x and, therefore, x > y since k = 0. The deductibility of the backward implication could be proved similarly.
Note that if w is an infinite number, then 2w = w + w is also infinite. On the other hand, 2w > w. In other words, it is impossible to reach 2w from w by adding one identity. The chain w < w < w < . . . does not end when it reaches the number 2w. It is clear that decreasing the number w by one, i.e., building the chain w > w 1 > w 2 > . . . , will never give a finite number. Following this reasoning, we introduce the following appropriate terminology.

Definition 10.
The block of infinite number w is the set B(w), defined by the formula ∃k(N(k) & (z = w + k ∨ z = w k)).
Apparently, a block is defined by any number that included in it. Theorem 9. Let w 1 be w 2 two infinite numbers. Then B(w 1 ) = B(w 2 ) if and only if ∃k(N(k) & (w 1 = w 2 + k ∨ w 2 = w 1 + k)).
The proof of this statement is trivial. Obviously, if two infinite numbers are not linked by the relation w 1 = w 2 ± k where k is a finite number, then their blocks do not intersect.
Thus, the class N from the external (descriptive) point of view consists of an initial segment of finite numbers, and then a class of disjoint blocks, each of which is isomorphic in the sense of order to integers from the point of view of set-theoretic mathematics. There is no "smallest" and "largest" block, because it is clear that 2w > w. On the other hand, if w 1 and w 2 are such that w 1 < w 2 and their blocks do not intersect, then by setting w = w 1 + w 2 2 (integer floor), we get that w 1 < w < w 2 and all three numbers are from different blocks. In other words, the order on the class of all blocks is dense. What is said in this paragraph also applies to the external description (structure) of the class N . There is a similar reasoning in [17].

The Existence of Infinite Numbers
Note that the existence of infinite numbers as well as their absence does not follow from the axioms of finite hyperarithmetic. Therefore, for a meaningful theory in our applications, it is necessary to add the axiom of the non-emptiness of the class of infinite numbers. As such an axiom, we introduce the W-axiom W := ∃x¬N(x).
Finally, we will consider as an alternative arithmetic a theory that includes axioms A 1 -A 21 , N 0 -N 4 , W. Further, basing on the adopted axiomatics, one can develop the theory of hyperrational numbers and functions.

Conclusions and Discussion
We have constructed a finite axiomatic theory of arithmetic that is sufficient for constructing an axiomatic hyperrational analysis.
Note that the author introduced a similar axiomatic system in his report at the conference at the A. I. Herzen Russian State Pedagogical University [18], but, firstly, this article does not appeal to the theory of models, added the results presented in Section 6 and the proofs of the main results, and also the axioms N 3 and N 4 were changed, and the axiom A 21 was added.
Earlier at Section 6.2, it was noted that reachable numbers could be obtained by applying the Markov (normal) algorithm, which could be represented as an algorithm in the {|} alphabet, described by the scheme Word := Empty word Word | (note the difference in size between BNF expansion character and the actual alphabet letter).
In other words, in the Zermelo-Fraenkel theory, there is an isomorphism between reachable numbers and words in the alphabet {|}. Thus, finite natural numbers in our theory from the external set theory point of view are constructive natural numbers.
In conclusion, let us focus on the issues not disclosed in this work, which sets relevant problems for further work.

1.
Investigation of the consistency and completeness of theories A and HA + W. Note that there are models of these theories in the set theory, and the HA model is an elementary extension of the A model. Note that the finite arithmetic takes an intermediate position between formalized number theory (being its subtheory) and R. Robinson's arithmetic [1], which is incomplete (recursively incomplete) and undecidable subtheory of finite arithmetic.

2.
The problem of minimizing the list of axioms of finite arithmetic and eliminating dependent axioms is also relevant. In the present work, the authors did not set this problem.

3.
The development of axiomatics of arithmetic sufficient for constructing of a hyperrational analysis, allowing the modelling of hypernatural numbers using sets of finite natural numbers, is still an important relevant problem. For example, polynomials of the form ∑ n i=0 a i Υ i , where n, a i ∈ Z, and Υ is some chosen infinite natural number, or other structures could be used. Solving this problem will create an algorithmically decidable hyperrational analysis.

Conflicts of Interest:
The authors declare no conflict of interest.