Five Variable Predicate Calculus for Boolean Valued Functions. Part I

Shunichi Kobayashi

Ueda Multimedia Information Center, Nagano

Summary.

In this paper, we proved some elementary predicate calculus formulae containing the quantifiers of Boolean valued functions with respect to partitions. Such a theory is an analogy of ordinary predicate logic.

MML Identifier: BVFUNC22

Contents (PDF format)

Bibliography

[1] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.

[2] Czeslaw Bylinski. Some basic properties of sets. Journal of Formalized Mathematics, 1, 1989.

[3] Czeslaw Bylinski. A classical first order language. Journal of Formalized Mathematics, 2, 1990.

[4] Czeslaw Bylinski. The modification of a function by a function and the iteration of the composition of a function. Journal of Formalized Mathematics, 2, 1990.

[5] Shunichi Kobayashi and Kui Jia. A theory of Boolean valued functions and partitions. Journal of Formalized Mathematics, 10, 1998.

[6] Shunichi Kobayashi and Kui Jia. A theory of partitions. Part I. Journal of Formalized Mathematics, 10, 1998.

[7] Shunichi Kobayashi and Yatsuka Nakamura. A theory of Boolean valued functions and quantifiers with respect to partitions. Journal of Formalized Mathematics, 10, 1998.

[8] Beata Padlewska. Families of sets. Journal of Formalized Mathematics, 1, 1989.

[9] Konrad Raczkowski and Pawel Sadowski. Equivalence relations and classes of abstraction. Journal of Formalized Mathematics, 1, 1989.

[10] Andrzej Trybulec. Enumerated sets. Journal of Formalized Mathematics, 1, 1989.

[11] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.

[12] Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1, 1989.

[13] Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1, 1989.