Have a personal or library account? Click to login
A Model of Mizar Concepts - Unification Cover

A Model of Mizar Concepts - Unification

Formalized Mathematics
Volume 18 (2010): Issue 1 (March 2010)
By: Grzegorz Bancerek  
Open Access
|Jan 2011

References

  1. [1] Grzegorz Bancerek. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. Cartesian product of functions. Formalized Mathematics, 2(4):547-552, 1991.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek. Subtrees. Formalized Mathematics, 5(2):185-190, 1996.
    Search in Google Scholar
  5. [5] Grzegorz Bancerek. Institution of many sorted algebras. Part I: Signature reduct of an algebra. Formalized Mathematics, 6(2):279-287, 1997.
    Search in Google Scholar
  6. [6] Grzegorz Bancerek. On the structure of Mizar types. In Herman Geuvers and Fairouz Kamareddine, editors, Electronic Notes in Theoretical Computer Science, volume 85. Elsevier, 2003.10.1016/S1571-0661(04)80758-8
    Search in Google Scholar
  7. [7] Grzegorz Bancerek. Towards the construction of a model of Mizar concepts. Formalized Mathematics, 16(2):207-230, 2008, doi:10.2478/v10037-008-0027-x.10.2478/v10037-008-0027-x
    Search in Google Scholar
  8. [8] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
    Search in Google Scholar
  9. [9] Grzegorz Bancerek and Artur Korniłowicz. Yet another construction of free algebra. Formalized Mathematics, 9(4):779-785, 2001.
    Search in Google Scholar
  10. [10] Grzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I. Formalized Mathematics, 5(3):367-380, 1996.
    Search in Google Scholar
  11. [11] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.
    Search in Google Scholar
  12. [12] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.
    Search in Google Scholar
  13. [13] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.
    Search in Google Scholar
  14. [14] Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.
    Search in Google Scholar
  15. [15] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.
    Search in Google Scholar
  16. [16] Beata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1):67-74, 1996.
    Search in Google Scholar
  17. [17] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.
    Search in Google Scholar
  18. [18] Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.
    Search in Google Scholar
  19. [19] Andrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.
    Search in Google Scholar
  20. [20] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
    Search in Google Scholar
  21. [21] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.
    Search in Google Scholar
  22. [22] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-010-0009-7 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 65 - 75
Published on: Jan 5, 2011
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
Computer sciences,
Computer sciences, other,
Mathematics,
General mathematics

© 2011 Grzegorz Bancerek, published by University of Białystok
This work is licensed under the Creative Commons License.

Volume 18 (2010): Issue 1 (March 2010)