Skip to main content
Have a personal or library account? Click to login
Towards the Construction of a Model of Mizar Concepts Cover

Towards the Construction of a Model of Mizar Concepts

Formalized Mathematics
Volume 16 (2008): Issue 2 (June 2008)
By:   
Open Access
|Mar 2009
References

References

  1. [1] Grzegorz Bancerek. Cardinal numbers., 1(2):377-382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The fundamental properties of natural numbers., 1(1):41-46, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. Introduction to trees., 1(2):421-427, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek. König's theorem., 1(3):589-593, 1990.
    Search in Google Scholar
  5. [5] Grzegorz Bancerek. Tarski's classes and ranks., 1(3):563-567, 1990.
    Search in Google Scholar
  6. [6] Grzegorz Bancerek. Complete lattices., 2(5):719-725, 1991.
    Search in Google Scholar
  7. [7] Grzegorz Bancerek. König's lemma., 2(3):397-402, 1991.
    Search in Google Scholar
  8. [8] Grzegorz Bancerek. Sets and functions of trees and joining operations of trees., 3(2):195-204, 1992.
    Search in Google Scholar
  9. [9] Grzegorz Bancerek. Joining of decorated trees., 4(1):77-82, 1993.
    Search in Google Scholar
  10. [10] Grzegorz Bancerek. Terms over many sorted universal algebra., 5(2):191-198, 1996.
    Search in Google Scholar
  11. [11] Grzegorz Bancerek. Bounds in posets and relational substructures., 6(1):81-91, 1997.
    Search in Google Scholar
  12. [12] Grzegorz Bancerek. Directed sets, nets, ideals, filters, and maps., 6(1):93-107, 1997.
    Search in Google Scholar
  13. [13] Grzegorz Bancerek. On semilattice structure of Mizar types., 11(4):355-369, 2003.
    Search in Google Scholar
  14. [14] Grzegorz Bancerek. On the structure of Mizar types. In Herman Geuvers and Fairouz Kamareddine, editors,, volume 85. Elsevier, 2003.
    Open DOISearch in Google Scholar
  15. [15] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1(1):107-114, 1990.
    Search in Google Scholar
  16. [16] Grzegorz Bancerek and Artur Korniłowicz. Yet another construction of free algebra., 9(4):779-785, 2001.
    Search in Google Scholar
  17. [17] Grzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I., 5(3):367-380, 1996.
    Search in Google Scholar
  18. [18] Grzegorz Bancerek and Piotr Rudnicki. On defining functions on trees., 4(1):91-101, 1993.
    Search in Google Scholar
  19. [19] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets., 1(3):529-536, 1990.
    Search in Google Scholar
  20. [20] Czesław Byliński. Functions and their basic properties., 1(1):55-65, 1990.
    Search in Google Scholar
  21. [21] Czesław Byliński. Functions from a set to a set., 1(1):153-164, 1990.
    Search in Google Scholar
  22. [22] Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function., 1(3):521-527, 1990.
    Search in Google Scholar
  23. [23] Czesław Byliński. Partial functions., 1(2):357-367, 1990.
    Search in Google Scholar
  24. [24] Czesław Byliński. Some basic properties of sets., 1(1):47-53, 1990.
    Search in Google Scholar
  25. [25] Patricia L. Carlson and Grzegorz Bancerek. Context-free grammar - part 1., 2(5):683-687, 1991.
    Search in Google Scholar
  26. [26] Agata Darmochwał. Finite sets., 1(1):165-167, 1990.
    Search in Google Scholar
  27. [27] Adam Grabowski and Robert Milewski. Boolean posets, posets under inclusion and products of relational structures., 6(1):117-121, 1997.
    Search in Google Scholar
  28. [28] Yatsuka Nakamura. Determinant of some matrices of field elements., 14(1):1-5, 2006.
    Open DOISearch in Google Scholar
  29. [29] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, I., 5(2):167-172, 1996.
    Search in Google Scholar
  30. [30] Beata Padlewska. Families of sets., 1(1):147-152, 1990.
    Search in Google Scholar
  31. [31] Beata Perkowska. Free many sorted universal algebra., 5(1):67-74, 1996.
    Search in Google Scholar
  32. [32] Andrzej Trybulec. Binary operations applied to functions., 1(2):329-334, 1990.
    Search in Google Scholar
  33. [33] Andrzej Trybulec. Domains and their Cartesian products., 1(1):115-122, 1990.
    Search in Google Scholar
  34. [34] Andrzej Trybulec. Enumerated sets., 1(1):25-34, 1990.
    Search in Google Scholar
  35. [35] Andrzej Trybulec. Tuples, projections and Cartesian products., 1(1):97-105, 1990.
    Search in Google Scholar
  36. [36] Andrzej Trybulec. Many-sorted sets., 4(1):15-22, 1993.
    Search in Google Scholar
  37. [37] Andrzej Trybulec. Many sorted algebras., 5(1):37-42, 1996.
    Search in Google Scholar
  38. [38] Andrzej Trybulec. On the sets inhabited by numbers., 11(4):341-347, 2003.
    Search in Google Scholar
  39. [39] Andrzej Trybulec and Agata Darmochwał. Boolean domains., 1(1):187-190, 1990.
    Search in Google Scholar
  40. [40] Wojciech A. Trybulec and Grzegorz Bancerek. Kuratowski - Zorn lemma., 1(2):387-393, 1990.
    Search in Google Scholar
  41. [41] Zinaida Trybulec. Properties of subsets., 1(1):67-71, 1990.
    Search in Google Scholar
  42. [42] Edmund Woronowicz. Relations and their basic properties., 1(1):73-83, 1990.
    Search in Google Scholar
  43. [43] Edmund Woronowicz. Relations defined on sets., 1(1):181-186, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-008-0027-x | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 207 - 230
Published on: Mar 20, 2009
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

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

Volume 16 (2008): Issue 2 (June 2008)
Previous article