On the structure of Mizar types

  title={On the structure of Mizar types},
  author={Grzegorz Bancerek},
  journal={Electron. Notes Theor. Comput. Sci.},
  • G. Bancerek
  • Published 1 September 2003
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.

Figures from this paper

A Model of Mizar Concepts - Unification
The theory presented is an abstraction from the existing implementation of the Mizar system and is devoted to the formalization of Mizar expressions, including standarized constructor signature, arity-rich signatures, and the unification of Mizr expressions.
Towards the Construction of a Model of Mizar Concepts
Towards the Construction of a Model of Mizar Concepts The aim of this paper is to develop a formal theory of Mizar linguistic concepts following the ideas from [14] and [13]. The theory here
On Semilattice Structure of Mizar Types
One can verify that every poset which is Mizar-widening-like is also Noetherian and upperbounded and has l.u.b.’s. One can verify that every sup-semilattice which is Noetherian is also
Solving Two Problems in General Topology Via Types
It is shown, based on two problems in general topology, how typed objects can be used instead of untyped text to better represent mathematical content understandable both for human and computer checker.
Mizar's Soft Type System
This paper will interpret Mizar types as soft types, by translating Mizar's type judgments into sequents of untyped first order predicate logic, and prove that the Mizar type system is correct with respect to this translation in the sense that each derivable type judgment translates to a provable sequent.
Presentation and Manipulation of Mizar Properties in an Isabelle Object Logic
This paper discusses various elements of the Mizar language and the possible ways how these can be represented in the Isabelle framework in order to allow a suitable way of working in typed set theory.
Flexary connectives in Mizar
Towards a Mizar Mathematical Library in OMDoc Format
This paper presents an experiment of using the Mizar system to transform the Mizr library into the OMDoc format (Open Mathematical Documents), an XML-based representation format for mathematical knowledge that is geared towards making formula structure and context dependencies explicit.
Trends in Contemporary Computer Science
Formal characterization of ADL in terms of Mizar attributes and clusters is given, obtaining also the characterization of the class of generalized almost distributive lattices.
Formalizing Foundations of Mathematics
This work represents three of the most important foundations Isabelle/HOL, Mizar, and ZFC set theory as well as relations between them and provides the starting point of a systematic study of formalized foundations in order to compare, relate, and integrate them.


An Overview of the MIZAR Project
The Mizar project is a long-term eeort aimed at developing software to support a working mathematician in preparing papers by designing a language for writing formal mathematics based on the Tarski-Grothendieck set theory.
Development of the theory of continuous lattices in Mizar
This paper reports on Mizar formalization of the theory of continuous lattices included in the A Compendium of Continuous Lattices, revealing that the substantial element of the convenience is the incorporation of computer algebra into Mizar system.
Commutative Algebra in the Mizar System
We report on the development of algebra in the Mizar system. This includes the construction of formal multivariate power series and polynomials as well as the definition of ideals up to a proof of
A Compendium of Continuous Lattices in MIZAR
This paper reports on the MIZAR formalization of the theory of continuous lattices as presented in Gierz et al.: A Compendium of Continuous Lattices, 1980, which is the most sizable effort aimed at mechanically checking some substantial and relatively recent field of advanced mathematics.
Translating Mizar for First Order Theorem Provers
  • J. Urban
  • Mathematics, Computer Science
  • 2003
The constructor system of the Mizar proof checking system is explained here on examples from Mizar articles, and its translation to untyped first-order syntax is described and discussed. This makes
On Equivalents of Well-foundedness - An experiment in Mizar
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively deened functions, uniqueness of recursively deened functions , and absence of descending !-chains)
Comparing Mathematical Provers
This work compares fifteen systems for the formalizations of mathematics with the computer based on the size of their library, the strength of their logic and their level of automation.
Algebraic Requirements for the Construction of Polynomial Rings
The Mizar construction of polynomials with an arbitrary number of variables has been described in [8]. In this paper, we present an alternative approach for formalizing polynomials with one variable.
On Equivalents of Well-Foundedness
Four statements equivalent to well-foundedness have been proved in Mizar and the proofs mechanically checked for correctness and stressed the importance of a systematic development of a mechanized data base for mathematics in the spirit of the QED Project.
Lim-inf Convergence and its Compactness
We describe the Mizar formalization of the proof of compactness of lim-inf convergence given in (W33) according to (C CL). Lim-inf convergence formalized in (W28) is a Moore-Smith convergence