Volume 28 (2020): Issue 1 (April 2020)

Timothy Makarios (with Isabelle/HOL¹) and John Harrison (with HOL-Light²) shown that “the Klein-Beltrami model of the hyperbolic plane satisfy all of Tarski’s axioms except his Euclidean axiom” [2],[3],[4],[5].

With the Mizar system [1] we use some ideas taken from Tim Makarios’s MSc thesis [10] to formalize some definitions (like the absolute) and lemmas necessary for the verification of the independence of the parallel postulate. In this article we prove that our constructed model (we prefer “Beltrami-Klein” name over “Klein-Beltrami”, which can be seen in the naming convention for Mizar functors, and even MML identifiers) satisfies the congruence symmetry, the congruence equivalence relation, and the congruence identity axioms formulated by Tarski (and formalized in Mizar as described briefly in [8]).

Timothy Makarios (with Isabelle/HOL¹) and John Harrison (with HOL-Light²) shown that “the Klein-Beltrami model of the hyperbolic plane satisfy all of Tarski’s axioms except his Euclidean axiom” [2],[3],[4, 5].

With the Mizar system [1] we use some ideas taken from Tim Makarios’s MSc thesis [10] to formalize some definitions and lemmas necessary for the verification of the independence of the parallel postulate. In this article, which is the continuation of [8], we prove that our constructed model satisfies the axioms of segment construction, the axiom of betweenness identity, and the axiom of Pasch due to Tarski, as formalized in [11] and related Mizar articles.

This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library [2] to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series (cf. [8]) and most of them are preliminaries needed in [7] or other forthcoming articles.

This article formalizes different variants of the complement graph in the Mizar system [3], based on the formalization of graphs in [6].

To evaluate our formal verification method on a real-size calculation circuit, in this article, we continue to formalize the concept of the 7-3 Compressor (STC) Circuit [6] for Wallace Tree [11], to define the structures of calculation units for a very fast multiplication algorithm for VLSI implementation [10]. We define the circuit structure of the tree constructions of the Generalized Full Adder Circuits (GFAs). We then successfully prove its circuit stability of the calculation outputs after four and six steps. The motivation for this research is to establish a technique based on formalized mathematics and its applications for calculation circuits with high reliability, and to implement the applications of the reliable logic synthesizer and hardware compiler [5].

This article formalized rings of fractions in the Mizar system [3], [4]. A construction of the ring of fractions from an integral domain, namely a quotient field was formalized in [7].

This article generalizes a construction of fractions to a ring which is commutative and has zero divisor by means of a multiplicatively closed set, say S, by known manner. Constructed ring of fraction is denoted by S^~R instead of S⁻¹R appeared in [1], [6]. As an important example we formalize a ring of fractions by a particular multiplicatively closed set, namely R \ p, where p is a prime ideal of R. The resulted local ring is denoted by R_p. In our Mizar article it is coded by R^~p as a synonym.

This article contains also the formal proof of a universal property of a ring of fractions, the total-quotient ring, a proof of the equivalence between the total-quotient ring and the quotient field of an integral domain.

The subset sum problem is a basic problem in the field of theoretical computer science, especially in the complexity theory [3]. The input is a sequence of positive integers and a target positive integer. The task is to determine if there exists a subsequence of the input sequence with sum equal to the target integer. It is known that the problem is NP-hard [2] and can be solved by dynamic programming in pseudo-polynomial time [1]. In this article we formalize the recurrence relation of the dynamic programming.

In the Mizar system ([1], [2]), Józef Białas has already given the one-dimensional Lebesgue measure [4]. However, the measure introduced by Białas limited the outer measure to a field with finite additivity. So, although it satisfies the nature of the measure, it cannot specify the length of measurable sets and also it cannot determine what kind of set is a measurable set. From the above, the authors first determined the length of the interval by the outer measure. Specifically, we used the compactness of the real space. Next, we constructed the pre-measure by limiting the outer measure to a semialgebra of intervals. Furthermore, by repeating the extension of the previous measure, we reconstructed the one-dimensional Lebesgue measure [7], [3].

We continue the formal development of rough inclusion functions (RIFs), continuing the research on the formalization of rough sets [15] – a well-known tool of modelling of incomplete or partially unknown information. In this article we give the formal characterization of complementary RIFs, following a paper by Gomolińska [4]. We expand this framework introducing Jaccard index, Steinhaus generate metric, and Marczewski-Steinhaus metric space [1]. This is the continuation of [9]; additionally we implement also parts of [2], [3], and the details of this work can be found in [7].

In this paper we demonstrate the feasibility of formalizing recreational mathematics in Mizar ([1], [2]) drawing examples from W. Sierpinski’s book “250 Problems in Elementary Number Theory” [4]. The current work contains proofs of initial ten problems from the chapter devoted to the divisibility of numbers. Included are problems on several levels of difficulty.

We continue in the Mizar system [2] the formalization of fuzzy implications according to the book of Baczyński and Jayaram “Fuzzy Implications” [1]. In this article we define fuzzy negations and show their connections with previously defined fuzzy implications [4] and [5] and triangular norms and conorms [6]. This can be seen as a step towards building a formal framework of fuzzy connectives [10]. We introduce formally Sugeno negation, boundary negations and show how these operators are pointwise ordered. This work is a continuation of the development of fuzzy sets [12], [3] in Mizar [7] started in [11] and partially described in [8]. This submission can be treated also as a part of a formal comparison of fuzzy and rough approaches to incomplete or uncertain information within the Mizar Mathematical Library [9].