Predicate Calculus for Boolean Valued Functions. Part XI

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 usual predicate logic.

MML Identifier: BVFUNC19

Contents (PDF format)

Bibliography

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

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

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

[4] Andrzej Trybulec. Function domains and Fr\aenkel operator. Journal of Formalized Mathematics, 2, 1990.

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

[6] Edmund Woronowicz. Interpretation and satisfiability in the first order logic. Journal of Formalized Mathematics, 2, 1990.

[7] Edmund Woronowicz. Many-argument relations. Journal of Formalized Mathematics, 2, 1990.