[[1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.]Search in Google Scholar
[[2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.]Search in Google Scholar
[[3] Grzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421-427, 1990.]Search in Google Scholar
[[4] Grzegorz Bancerek. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.]Search in Google Scholar
[[5] Grzegorz Bancerek. Tarski's classes and ranks. Formalized Mathematics, 1(3):563-567, 1990.]Search in Google Scholar
[[6] Grzegorz Bancerek. Complete lattices. Formalized Mathematics, 2(5):719-725, 1991.]Search in Google Scholar
[[7] Grzegorz Bancerek. König's lemma. Formalized Mathematics, 2(3):397-402, 1991.]Search in Google Scholar
[[8] Grzegorz Bancerek. Sets and functions of trees and joining operations of trees. Formalized Mathematics, 3(2):195-204, 1992.]Search in Google Scholar
[[9] Grzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993.]Search in Google Scholar
[[10] Grzegorz Bancerek. Terms over many sorted universal algebra. Formalized Mathematics, 5(2):191-198, 1996.]Search in Google Scholar
[[11] Grzegorz Bancerek. Bounds in posets and relational substructures. Formalized Mathematics, 6(1):81-91, 1997.]Search in Google Scholar
[[12] Grzegorz Bancerek. Directed sets, nets, ideals, filters, and maps. Formalized Mathematics, 6(1):93-107, 1997.]Search in Google Scholar
[[13] Grzegorz Bancerek. On semilattice structure of Mizar types. Formalized Mathematics, 11(4):355-369, 2003.]Search in Google Scholar
[[14] 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
[[15] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.]Search in Google Scholar
[[16] Grzegorz Bancerek and Artur Korniłowicz. Yet another construction of free algebra. Formalized Mathematics, 9(4):779-785, 2001.]Search in Google Scholar
[[17] Grzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I. Formalized Mathematics, 5(3):367-380, 1996.]Search in Google Scholar
[[18] Grzegorz Bancerek and Piotr Rudnicki. On defining functions on trees. Formalized Mathematics, 4(1):91-101, 1993.]Search in Google Scholar
[[19] 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
[[20] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.]Search in Google Scholar
[[21] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.]Search in Google Scholar
[[22] Czesł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.]Search in Google Scholar
[[23] Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.]Search in Google Scholar
[[24] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.]Search in Google Scholar
[[25] Patricia L. Carlson and Grzegorz Bancerek. Context-free grammar - part 1. Formalized Mathematics, 2(5):683-687, 1991.]Search in Google Scholar
[[26] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.]Search in Google Scholar
[[27] Adam Grabowski and Robert Milewski. Boolean posets, posets under inclusion and products of relational structures. Formalized Mathematics, 6(1):117-121, 1997.]Search in Google Scholar
[[28] Yatsuka Nakamura. Determinant of some matrices of field elements. Formalized Mathematics, 14(1):1-5, 2006.10.2478/v10037-006-0001-4]Search in Google Scholar
[[29] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, I. Formalized Mathematics, 5(2):167-172, 1996.]Search in Google Scholar
[[30] Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.]Search in Google Scholar
[[31] Beata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1):67-74, 1996.]Search in Google Scholar
[[32] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.]Search in Google Scholar
[[33] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.]Search in Google Scholar
[[34] Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25-34, 1990.]Search in Google Scholar
[[35] Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.]Search in Google Scholar
[[36] Andrzej Trybulec. Many-sorted sets. Formalized Mathematics, 4(1):15-22, 1993.]Search in Google Scholar
[[37] Andrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.]Search in Google Scholar
[[38] Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4):341-347, 2003.]Search in Google Scholar
[[39] Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1(1):187-190, 1990.]Search in Google Scholar
[[40] Wojciech A. Trybulec and Grzegorz Bancerek. Kuratowski - Zorn lemma. Formalized Mathematics, 1(2):387-393, 1990.]Search in Google Scholar
[[41] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.]Search in Google Scholar
[[42] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.]Search in Google Scholar
[[43] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.]Search in Google Scholar
