Summary A (di)graph without parallel edges can simply be represented by a binary relation of the vertices and on the other hand, any binary relation can be expressed as such a graph. In this article, this correspondence is formalized in the Mizar system [2], based on the formalization of graphs in [6] and relations in [11], [12]. Notably, a new definition of createGraph will be given, taking only a non empty set V and a binary relation E ⊆ V × V to create a (di)graph without parallel edges, which will provide to be very useful in future articles.
{"title":"Unification of Graphs and Relations in Mizar","authors":"Sebastian Koch","doi":"10.2478/forma-2020-0015","DOIUrl":"https://doi.org/10.2478/forma-2020-0015","url":null,"abstract":"Summary A (di)graph without parallel edges can simply be represented by a binary relation of the vertices and on the other hand, any binary relation can be expressed as such a graph. In this article, this correspondence is formalized in the Mizar system [2], based on the formalization of graphs in [6] and relations in [11], [12]. Notably, a new definition of createGraph will be given, taking only a non empty set V and a binary relation E ⊆ V × V to create a (di)graph without parallel edges, which will provide to be very useful in future articles.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"66 1","pages":"173 - 186"},"PeriodicalIF":0.3,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87146877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary In this paper we introduce some notions to facilitate formulating and proving properties of iterative algorithms encoded in nominative data language [19] in the Mizar system [3], [1]. It is tested on verification of the partial correctness of an algorithm computing n-th Fibonacci number: i := 0 s := 0 b := 1 c := 0 while (i <> n) c := s s := b b := c + s i := i + 1 return s This paper continues verification of algorithms [10], [13], [12] written in terms of simple-named complex-valued nominative data [6], [8], [17], [11], [14], [15]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2], [4] with partial pre- and post-conditions [16], [18], [7], [5].
本文引入了一些概念，以便于在Mizar系统[3]，[1]中表述和证明用指示性数据语言[19]编码的迭代算法的性质。验证了计算第n个斐波那契数的算法的部分正确性:i:= 0 s:= 0 b:= 1 c:= 0 while (i <> n) c:= ss:= b b:= c + si:= i + 1 return s。本文继续验证用简单命名复值指示数据[6]、[8]、[17]、[11]、[14]、[15]编写的算法[10]、[13]、[12]。该算法的有效性以此类数据上的语义Floyd-Hoare三元组的形式呈现[9]。正确性的证明是基于一个扩展的Floyd-Hoare逻辑[2]，[4]的推理系统，该推理系统具有部分前置和后置条件[16]，[18]，[7]，[5]。
{"title":"Partial Correctness of a Fibonacci Algorithm","authors":"Artur Korniłowicz","doi":"10.2478/forma-2020-0016","DOIUrl":"https://doi.org/10.2478/forma-2020-0016","url":null,"abstract":"Summary In this paper we introduce some notions to facilitate formulating and proving properties of iterative algorithms encoded in nominative data language [19] in the Mizar system [3], [1]. It is tested on verification of the partial correctness of an algorithm computing n-th Fibonacci number: i := 0 s := 0 b := 1 c := 0 while (i <> n) c := s s := b b := c + s i := i + 1 return s This paper continues verification of algorithms [10], [13], [12] written in terms of simple-named complex-valued nominative data [6], [8], [17], [11], [14], [15]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2], [4] with partial pre- and post-conditions [16], [18], [7], [5].","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"31 1","pages":"187 - 196"},"PeriodicalIF":0.3,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82064817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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].
{"title":"On Fuzzy Negations Generated by Fuzzy Implications","authors":"Adam Grabowski","doi":"10.2478/forma-2020-0011","DOIUrl":"https://doi.org/10.2478/forma-2020-0011","url":null,"abstract":"Summary 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].","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"46 Suppl 6 1","pages":"121 - 128"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76507589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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.
{"title":"Dynamic Programming for the Subset Sum Problem","authors":"H. Fujiwara, Hokuto Watari, Hiroaki Yamamoto","doi":"10.2478/forma-2020-0007","DOIUrl":"https://doi.org/10.2478/forma-2020-0007","url":null,"abstract":"Summary 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.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"1 1","pages":"89 - 92"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91156224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary Timothy Makarios (with Isabelle/HOL1) and John Harrison (with HOL-Light2) 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.
Timothy Makarios (with Isabelle/HOL1)和John Harrison (with HOL-Light2)证明了“双曲平面的Klein-Beltrami模型满足Tarski的所有公理，除了他的欧几里得公理”[2]，[3]，[4,5]。对于Mizar系统[1]，我们使用了Tim Makarios的硕士论文[10]中的一些思想来形式化验证平行公设独立性所需的一些定义和引理。在本文中，作为[8]的延续，我们证明了我们构造的模型满足[11]和相关Mizar文章中形式化的分段构造公理、中间恒等式公理和Pasch due to Tarski公理。
{"title":"Klein-Beltrami model. Part IV","authors":"Roland Coghetto","doi":"10.2478/forma-2020-0002","DOIUrl":"https://doi.org/10.2478/forma-2020-0002","url":null,"abstract":"Summary Timothy Makarios (with Isabelle/HOL1) and John Harrison (with HOL-Light2) 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.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"376 1","pages":"21 - 9"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78063746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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].
{"title":"Developing Complementary Rough Inclusion Functions","authors":"Adam Grabowski","doi":"10.2478/forma-2020-0009","DOIUrl":"https://doi.org/10.2478/forma-2020-0009","url":null,"abstract":"Summary 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].","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"30 1","pages":"105 - 113"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87759879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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−1R 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 Rp. 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.
{"title":"Rings of Fractions and Localization","authors":"Yasushige Watase","doi":"10.2478/forma-2020-0006","DOIUrl":"https://doi.org/10.2478/forma-2020-0006","url":null,"abstract":"Summary 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−1R 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 Rp. 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.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"58 1","pages":"79 - 87"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80934879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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.
{"title":"Miscellaneous Graph Preliminaries","authors":"Sebastian Koch","doi":"10.2478/forma-2020-0003","DOIUrl":"https://doi.org/10.2478/forma-2020-0003","url":null,"abstract":"Summary 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.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"38 1","pages":"23 - 39"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86775849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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.
{"title":"Elementary Number Theory Problems. Part I","authors":"Adam Naumowicz","doi":"10.2478/forma-2020-0010","DOIUrl":"https://doi.org/10.2478/forma-2020-0010","url":null,"abstract":"Summary 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.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"40 1","pages":"115 - 120"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88156493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary 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].
{"title":"Reconstruction of the One-Dimensional Lebesgue Measure","authors":"N. Endou","doi":"10.2478/forma-2020-0008","DOIUrl":"https://doi.org/10.2478/forma-2020-0008","url":null,"abstract":"Summary 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].","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":"50 1","pages":"104 - 93"},"PeriodicalIF":0.3,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86601961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：