Journal of Formalized Mathematics
Volume 11, 1999
University of Bialystok
Copyright (c) 1999
Association of Mizar Users
Predicate Calculus for Boolean Valued Functions. Part II

Shunichi Kobayashi

Shinshu University, Nagano

Yatsuka Nakamura

Shinshu University, Nagano
Summary.

In this paper, we have 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.
The terminology and notation used in this paper have been
introduced in the following articles
[5]
[7]
[10]
[9]
[8]
[1]
[6]
[4]
[2]
[3]

Preliminaries

Predicate Calculus
Bibliography
 [1]
Czeslaw Bylinski.
Functions and their basic properties.
Journal of Formalized Mathematics,
1, 1989.
 [2]
Shunichi Kobayashi and Kui Jia.
A theory of Boolean valued functions and partitions.
Journal of Formalized Mathematics,
10, 1998.
 [3]
Shunichi Kobayashi and Yatsuka Nakamura.
A theory of Boolean valued functions and quantifiers with respect to partitions.
Journal of Formalized Mathematics,
10, 1998.
 [4]
Konrad Raczkowski and Pawel Sadowski.
Equivalence relations and classes of abstraction.
Journal of Formalized Mathematics,
1, 1989.
 [5]
Andrzej Trybulec.
Tarski Grothendieck set theory.
Journal of Formalized Mathematics,
Axiomatics, 1989.
 [6]
Andrzej Trybulec.
Function domains and Fr\aenkel operator.
Journal of Formalized Mathematics,
2, 1990.
 [7]
Zinaida Trybulec.
Properties of subsets.
Journal of Formalized Mathematics,
1, 1989.
 [8]
Edmund Woronowicz.
Relations and their basic properties.
Journal of Formalized Mathematics,
1, 1989.
 [9]
Edmund Woronowicz.
Interpretation and satisfiability in the first order logic.
Journal of Formalized Mathematics,
2, 1990.
 [10]
Edmund Woronowicz.
Manyargument relations.
Journal of Formalized Mathematics,
2, 1990.
Received March 13, 1999
[
Download a postscript version,
MML identifier index,
Mizar home page]