REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/21033
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorBancerek, Grzegorz-
dc.date.accessioned2026-09-15T12:35:45Z-
dc.date.available2026-09-15T12:35:45Z-
dc.date.issued2008-
dc.identifier.citationFormalized Mathematics, Volume 16, Issue 2, 2008, Pages 207-230pl
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/21033-
dc.description.abstractThe aim of this paper is to develop a formal theory of Mizar linguistic concepts following the ideas from [14] and [13]. The theory here presented is an abstract of the existing implementation of the Mizar system and is devoted to the formalization of Mizar expressions. The base idea behind the formalization is dependence on variables which is determined by variable-dependence (variables may depend on other variables). The dependence constitutes a Galois connection between opposite poset of dependence-closed set of variables and the sup-semilattice of widening of Mizar types (smooth type widening). In the paper the concepts strictly connected with Mizar expressions are for malized. Among them are quasi-loci, quasi-terms, quasi-adjectives, and quasi types. The structural induction and operation of substitution are also introduced. The prefix quasi is used to indicate that some rules of construction of Mizar expressions may not be fulfilled. For example, variables, quasi-loci, and quasi terms have no assigned types and, in result, there is no possibility to conduct type-checking of arguments. The other gaps concern inconsistent and out-of context clusters of adjectives in types. Those rules are required in the Mizar identification process. However, the expression appearing in later processes of Mizar checker may not satisfy the rules. So, introduced apparatus is enough and adequate to describe data structures and algorithms from the Mizar checker (like equational classes).pl
dc.language.isoenpl
dc.publisherUniversity of Białystokpl
dc.rights.urihttps://creativecommons.org/licenses/by-sa/4.0/-
dc.titleTowards the Construction of a Model of Mizar Conceptspl
dc.typeArticlepl
dc.rights.holder© 2009 Grzegorz Bancerek, published by University of Białystokpl
dc.rights.holderThis work is licensed under the Creative Commons Licensepl
dc.identifier.doi10.2478/v10037-008-0027-x-
dc.description.AffiliationBiałystok Technical University, Polandpl
dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990.pl
dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.pl
dc.description.referencesGrzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421–427, 1990.pl
dc.description.referencesGrzegorz Bancerek. K¨onig’s theorem. Formalized Mathematics, 1(3):589–593, 1990.pl
dc.description.referencesGrzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563–567, 1990.pl
dc.description.referencesGrzegorz Bancerek. Complete lattices. Formalized Mathematics, 2(5):719–725, 1991.pl
dc.description.referencesGrzegorz Bancerek. K¨onig’s lemma. Formalized Mathematics, 2(3):397–402, 1991.pl
dc.description.referencesGrzegorz Bancerek. Sets and functions of trees and joining operations of trees. Formalized Mathematics, 3(2):195–204, 1992.pl
dc.description.referencesGrzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77–82, 1993.pl
dc.description.referencesGrzegorz Bancerek. Terms over many sorted universal algebra. Formalized Mathematics, 5(2):191–198, 1996.pl
dc.description.referencesGrzegorz Bancerek. Bounds in posets and relational substructures. Formalized Mathematics, 6(1):81–91, 1997.pl
dc.description.referencesGrzegorz Bancerek. Directed sets, nets, ideals, filters, and maps. Formalized Mathematics, 6(1):93–107, 1997.pl
dc.description.referencesGrzegorz Bancerek. On semilattice structure of Mizar types. Formalized Mathematics, 11(4):355–369, 2003.pl
dc.description.referencesGrzegorz Bancerek. On the structure of Mizar types. In Herman Geuvers and Fairouz Kamareddine, editors, Electronic Notes in Theoretical Computer Science, volume 85. Elsevier, 2003.pl
dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.pl
dc.description.referencesGrzegorz Bancerek and Artur Korniłowicz. Yet another construction of free algebra. Formalized Mathematics, 9(4):779–785, 2001.pl
dc.description.referencesGrzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I. Formalized Mathematics, 5(3):367–380, 1996.pl
dc.description.referencesGrzegorz Bancerek and Piotr Rudnicki. On defining functions on trees. Formalized Mathematics, 4(1):91–101, 1993.pl
dc.description.referencesCzesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990.pl
dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.pl
dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.pl
dc.description.referencesCzesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521–527, 1990.pl
dc.description.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.pl
dc.description.referencesCzesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.pl
dc.description.referencesPatricia L. Carlson and Grzegorz Bancerek. Context-free grammar– part 1. Formalized Mathematics, 2(5):683–687, 1991.pl
dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.pl
dc.description.referencesAdam Grabowski and Robert Milewski. Boolean posets, posets under inclusion and products of relational structures. Formalized Mathematics, 6(1):117–121, 1997.pl
dc.description.referencesYatsuka Nakamura. Determinant of some matrices of field elements. Formalized Mathematics, 14(1):1–5, 2006.pl
dc.description.referencesYatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, I. Formalized Mathematics, 5(2):167–172, 1996.pl
dc.description.referencesBeata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990.pl
dc.description.referencesBeata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1):67-74, 1996.pl
dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329–334, 1990.pl
dc.description.referencesAndrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115–122, 1990.pl
dc.description.referencesAndrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25–34, 1990.pl
dc.description.referencesAndrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97–105, 1990.pl
dc.description.referencesAndrzej Trybulec. Many-sorted sets. Formalized Mathematics, 4(1):15–22, 1993.pl
dc.description.referencesAndrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37–42, 1996.pl
dc.description.referencesAndrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4):341-347, 2003.pl
dc.description.referencesAndrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1(1):187–190, 1990.pl
dc.description.referencesWojciech A. Trybulec and Grzegorz Bancerek. Kuratowski– Zorn lemma. Formalized Mathematics, 1(2):387–393, 1990.pl
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.pl
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990.pl
dc.description.referencesEdmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990.pl
dc.identifier.eissn1898-9934-
dc.description.firstpage207pl
dc.description.lastpage230pl
dc.identifier.citation2Formalized Mathematicspl
Występuje w kolekcji(ach):Formalized Mathematics, 2008, Volume 16, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
Towards_the_Construction_of_a_Model_of_Mizar_Concepts.pdf321,3 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons