The Mizar system consists of a
formal language
In logic, mathematics, computer science, and linguistics, a formal language is a set of strings whose symbols are taken from a set called "alphabet".
The alphabet of a formal language consists of symbols that concatenate into strings (also c ...
for writing mathematical definitions and proofs, a
proof assistant, which is able to
mechanically check proofs written in this language, and a library of
formalized mathematics, which can be used in the proof of new theorems.
The system is maintained and developed by the Mizar Project, formerly under the direction of its founder
Andrzej Trybulec.
In 2009 the Mizar Mathematical Library was the largest coherent body of strictly formalized mathematics in existence.
History
The Mizar Project was started around 1973 by
Andrzej Trybulec as an attempt to reconstruct mathematical
vernacular
Vernacular is the ordinary, informal, spoken language, spoken form of language, particularly when perceptual dialectology, perceived as having lower social status or less Prestige (sociolinguistics), prestige than standard language, which is mor ...
so it can be checked by a computer. Its current goal, apart from the continual development of the Mizar System, is the collaborative creation of a large library of formally verified proofs, covering most of the core of modern mathematics. This is in line with the influential
QED manifesto.
Currently the project is developed and maintained by research groups at
Białystok University, Poland, the
University of Alberta
The University of Alberta (also known as U of A or UAlberta, ) is a public research university located in Edmonton, Alberta, Canada. It was founded in 1908 by Alexander Cameron Rutherford, the first premier of Alberta, and Henry Marshall Tory, t ...
, Canada, and
Shinshu University, Japan. While the Mizar proof checker remains proprietary,
[Mailing list discussion](_blank)
referring to the close-sourcing of Mizar. the Mizar Mathematical Library—the sizable body of formalized mathematics that it verified—is licensed open-source.
referring to the open-sourcing of MML.
Papers related to the Mizar system regularly appear in the peer-reviewed journals of the mathematic formalization academic community. These include ''
Studies in Logic, Grammar and Rhetoric'', ''Intelligent Computer Mathematics'', ''
Interactive Theorem Proving'', ''
Journal of Automated Reasoning'' and the ''
Journal of Formalized Reasoning''.
Mizar language
The distinctive feature of the Mizar language is its readability. As is common in mathematical text, it relies on
classical logic
Classical logic (or standard logic) or Frege–Russell logic is the intensively studied and most widely used class of deductive logic. Classical logic has had much influence on analytic philosophy.
Characteristics
Each logical system in this c ...
and a
declarative style. Mizar articles are written in ordinary
ASCII
ASCII ( ), an acronym for American Standard Code for Information Interchange, is a character encoding standard for representing a particular set of 95 (English language focused) printable character, printable and 33 control character, control c ...
, but the language was designed to be close enough to the mathematical vernacular that most mathematicians could read and understand Mizar articles without special training.
Yet, the language enables the increased level of formality necessary for
automated proof checking
In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human–machine collaboration. This involves some sort of interactive proof edi ...
.
For a proof to be admitted, all steps have to be justified either by elementary logical arguments or by citing previously verified proofs. This results in a higher level of rigor and detail than is customary in mathematical textbooks and publications. Thus, a typical Mizar article is about four times as long as an equivalent paper written in ordinary style.
Formalization is relatively labor-intensive, but not impossibly difficult. Once one is versed in the system, it takes about one week of full-time work to have a textbook page formally verified. This suggests that its benefits are now within the reach of applied fields such as
probability theory
Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expre ...
and
economics
Economics () is a behavioral science that studies the Production (economics), production, distribution (economics), distribution, and Consumption (economics), consumption of goods and services.
Economics focuses on the behaviour and interac ...
.
Mizar Mathematical Library
The Mizar Mathematical Library (MML) includes all theorems to which authors can refer in newly written articles. Once approved by the proof checker they are further evaluated in a process of
peer-review
Peer review is the evaluation of work by one or more people with similar competencies as the producers of the work ( peers). It functions as a form of self-regulation by qualified members of a profession within the relevant field. Peer review ...
for appropriate contribution and style. If accepted they are published in the associated ''Journal of Formalized Mathematics''
[''Journal of Formalized Mathematics''](_blank)
/ref> and added to the MML.
Breadth
As of July 2012, the MML included 1150 articles written by 241 authors.[The MML Query search engine](_blank)
/ref> In aggregate, these contain more than 10,000 formal definitions of mathematical objects and about 52,000 theorems proved on these objects. More than 180 named mathematical facts have been given formal codification in this manner. Some examples are the Hahn–Banach theorem
In functional analysis, the Hahn–Banach theorem is a central result that allows the extension of bounded linear functionals defined on a vector subspace of some vector space to the whole space. The theorem also shows that there are sufficient ...
, Kőnig's lemma, the Brouwer fixed point theorem, Gödel's completeness theorem
Gödel's completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantics, semantic truth and syntactic Provability logic, provability in first-order logic.
The completeness theorem applies ...
, and the Jordan curve theorem.
This breadth of coverage has led some to suggest Mizar as one of the leading approximations to the QED utopia of encoding all core mathematics in computer verifiable form.
Availability
All MML articles are available in PDF
Portable document format (PDF), standardized as ISO 32000, is a file format developed by Adobe Inc., Adobe in 1992 to present documents, including text formatting and images, in a manner independent of application software, computer hardware, ...
form as the papers of the ''Journal of Formalized Mathematics''. The full text of the MML is distributed with the Mizar checker and can be freely downloaded from the Mizar website. In an ongoing recent project the library was also made available in an experimental wiki
A wiki ( ) is a form of hypertext publication on the internet which is collaboratively edited and managed by its audience directly through a web browser. A typical wiki contains multiple pages that can either be edited by the public or l ...
form[The MML in wiki form](_blank)
/ref> that only admits edits when they are approved by the Mizar checker.
The MML Query website implements a powerful search engine for the contents of the MML. Among other abilities, it can retrieve all MML theorems proved about any particular type or operator.
Logical structure
The MML is built on the axioms of the Tarski–Grothendieck set theory. Even though semantically all objects are sets, the language allows one to define and use syntactical weak types. For example, a set may be declared to be of type Nat only when its internal structure conforms with a particular list of requirements. In turn, this list serves as the definition of the natural numbers
In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positiv ...
and the set of all the sets that conform to this list is denoted as NAT. This implementation of types seeks to reflect the way most mathematicians formally think of symbols and so streamline codification.
Mizar Proof Checker
Distributions of the Mizar Proof Checker for all major operating systems are freely available for download at the Mizar Project website. Use of the proof checker is free for all non-commercial purposes. It is written in Free Pascal and the source code is available on GitHub.[Mizar source code](_blank)
/ref>
See also
* Isar (Isabelle)
* Metamath
References
External links
*
{{authority control
Large-scale mathematical formalization projects
Proof assistants
Dependently typed languages
Educational math software
Pascal (programming language) software
Programming languages created in 1973