[Broderick Arneson and Piotr Rudnicki. Recognizing chordal raphs: Lex BFS and MCS. Formalized Mathematics, 14(4):187-205, 2006, doi:10.2478/v10037-006-0022-z.10.2478/v10037-006-0022-z]Search in Google Scholar
[Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.]Search in Google Scholar
[Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.]Search in Google Scholar
[Grzegorz Bancerek. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.]Search in Google Scholar
[Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.]Search in Google Scholar
[Grzegorz Bancerek. Monoids. Formalized Mathematics, 3(2):213-225, 1992.]Search in Google Scholar
[Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.]Search in Google Scholar
[Grzegorz Bancerek and Yasunari Shidama. Introduction to matroids. Formalized Mathematics, 16(4):325-332, 2008, doi:10.2478/v10037-008-0040-0.10.2478/v10037-008-0040-0]Search in Google Scholar
[Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485-492, 1996.]Search in Google Scholar
[Czesław Byliński. Basic functions and operations on functions. Formalized Mathematics, 1(1):245-254, 1990.]Search in Google Scholar
[Czesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.]Search in Google Scholar
[Czesław Byliński. The complex numbers. Formalized Mathematics, 1(3):507-513, 1990.]Search in Google Scholar
[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
[Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.]Search in Google Scholar
[Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.]Search in Google Scholar
[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
[Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.]Search in Google Scholar
[Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.]Search in Google Scholar
[Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.]Search in Google Scholar
[M. Lothaire. Algebraic combinatorics on words. Cambridge Univ Pr, 2002.10.1017/CBO9781107326019]Search in Google Scholar
[Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.]Search in Google Scholar
[Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.]Search in Google Scholar
[Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.]Search in Google Scholar
[Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.]Search in Google Scholar
[Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.]Search in Google Scholar
[Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.]Search in Google Scholar
[Edmund Woronowicz. Many-argument relations. Formalized Mathematics, 1(4):733-737, 1990.]Search in Google Scholar
[Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.]Search in Google Scholar
[Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.]Search in Google Scholar
[Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.]Search in Google Scholar
