Open Access

Pseudo-Canonical Formulae are Classical

Formalized Mathematics's Cover Image
Formalized Mathematics
Special Issue: 25 years of the Mizar Mathematical Library

Cite

[1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990.Search in Google Scholar

[2] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.Search in Google Scholar

[3] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.Search in Google Scholar

[4] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.Search in Google Scholar

[5] Czesław Byliński. Basic functions and operations on functions. Formalized Mathematics, 1(1):245–254, 1990.Search in Google Scholar

[6] 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

[7] Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.Search in Google Scholar

[8] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.Search in Google Scholar

[9] Marco B. Caminati. Preliminaries to classical first order model theory. Formalized Mathematics, 19(3):155–167, 2011. doi:10.2478/v10037-011-0025-2.10.2478/v10037-011-0025-2Search in Google Scholar

[10] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.Search in Google Scholar

[11] Adam Grabowski. Hilbert positive propositional calculus. Formalized Mathematics, 8(1): 69–72, 1999.Search in Google Scholar

[12] Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990.Search in Google Scholar

[13] Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335–338, 1997.Search in Google Scholar

[14] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1): 115–122, 1990.Search in Google Scholar

[15] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329–334, 1990.Search in Google Scholar

[16] Andrzej Trybulec. Defining by structural induction in the positive propositional language. Formalized Mathematics, 8(1):133–137, 1999.Search in Google Scholar

[17] Andrzej Trybulec. The canonical formulae. Formalized Mathematics, 9(3):441–447, 2001.Search in Google Scholar

[18] Andrzej Trybulec. Classes of independent partitions. Formalized Mathematics, 9(3): 623–625, 2001.Search in Google Scholar

[19] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.Search in Google Scholar

[20] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990.Search in Google Scholar

[21] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990.Search in Google Scholar

[22] Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85–89, 1990.Search in Google Scholar

eISSN:
1898-9934
Language:
English
Publication timeframe:
4 times per year
Journal Subjects:
Computer Sciences, other, Mathematics, General Mathematics