1 Introduction
The study of the cardinal numbers and the related properties are one of the corner stones in set theory. To explore different branches of mathematics, the use of cardinal numbers is invincible. In particular, the study of the transfinite cardinal numbers in classical set theory, initiated by George Cantor at the second half of the nineteenth century, has drawn special attention from the set theorists. On the contrary, cardinal numbers in different non-classical set theories are not investigated in a large scale, except the intuitionistic Zermelo–Fraenkel set theory (
$\mathrm {IZF}$
) and the constructive Zermelo–Fraenkel set theory (
$\mathrm {CZF}$
; cf. [Reference Aczel and Rathjen1, Reference Bell2, Reference Friedman and Ščedrov5]). In this paper, we develop a foundation of mathematics by exploring the cardinal numbers in the algebra-valued models of certain non-classical set theories, extending the study of ordinals in [Reference Tarafder, Banerjee and Krishna11]: the validity or independence of the set-theoretic sentences like Cantor’s theorem, the Schröder–Bernstein theorem, mathematical induction, the
$\mathsf {Axiom~of~Choice}$
, the generalized continuum hypothesis, etc. is the same as their status in the classical set theory.
The set theories, which are studied in this paper, are said to be non-classical as their underlying logics are non-classical. To compare it to the well-known non-classical set theory
$\mathrm {IZF}$
, we notice that the underlying logic of
$\mathrm {IZF}$
is the intuitionistic logic, where tertium non datur fails: there exists a formula
$\varphi $
such that
$\varphi \vee \neg \varphi $
is not valid. But, the set-theoretic axioms are the same as the classical Zermelo–Fraenkel (
$\mathrm {ZF}$
) axioms. As one of the examples of the non-classical set theories developed in this paper, we may consider paraconsistent set theories, whose underlying logics are paraconsistent: there are formulas
$\varphi $
and
$\psi $
such that the formula
$(\varphi \wedge \neg \varphi ) \to \psi $
is invalid. But the set-theoretic axiom system is a fragment of the classical
$\mathrm {ZF}$
axioms, viz. the negation-free fragment of
$\mathrm {ZF}$
, formally defined in Section 2. However, if the underlying logic is considered to be the classical logic or the intuitionistic logic, then the negation-free fragment of
$\mathrm {ZF}$
is proved to be equivalent with the full
$\mathrm {ZF}$
axiom system.
Although, the theory of cardinal numbers is well-developed in the literature of
$\mathrm {IZF}$
, one can find some basic differences between the properties of cardinal numbers in
$\mathrm {IZF}$
and the classical set theory. On the contrary, the properties of cardinal numbers in the non-classical set theories, developed in this paper, are similar to those in the classical set theory. A comparative study in this perspective between these non-classical set theories,
$\mathrm {IZF}$
, and the classical set theory can be found in Section 7.
We can argue similarly when it turns about most of the paraconsistent set theories already developed. Syntactic developments of different paraconsistent logics can be found in the literature (cf. [Reference da Costa, Krause and Bueno3, Reference Priest, Gabbay and Guenthner10]), but semantic developments are harder to find [Reference Esser4, Reference Weber14]. The study of the paraconsistent set theories is also very rare in the literature. One of the fundamental problems in studying paraconsistent set theories is a lack of models, although some investigation has been done (cf. [Reference Jockwich and Venturi7–Reference Löwe and Tarafder9, Reference Tarafder, Banerjee and Krishna11, Reference Tarafder and Venturi13]). As a result, it is also hard to find the paraconsistent mathematical realms. This paper produces a class of paraconsistent set theories besides the other non-classical set theories, more precisely, the algebra-valued models of these theories. We prove that the basic foundations of cardinal numbers in these paraconsistent set theories are similar to those of classical mathematics.
In Section 2, we discuss the background of generalized algebra-valued models of set theories, following the construction of [Reference Löwe and Tarafder9]. From Section 3 onwards, we develop algebra-valued models of the non-classical set theories mentioned above. As a first step, we define a class of well-ordered deductive reasonable implication algebras, generalizing [Reference Jockwich and Venturi7], then we discuss their corresponding algebra-valued models. This section ends with a discussion of the ordinal numbers, which generalizes the study of ordinal numbers found in [Reference Tarafder, Banerjee and Krishna11]. The natural numbers in these models are studied in Section 4. It is proved that the smallest inductive set is the set of all natural numbers. Finally, it is shown that all these models validate the principle of mathematical induction. At the beginning of Section 5 we prove that the
$\mathsf {Axiom~of~Choice}$
is valid in these non-classical algebra-valued models if it is valid in the ground model. This is used to define one of the most important notions of this paper, cardinality. Cantor’s theorem on cardinal numbers and the Schröder–Bernstein theorem are proved to be valid. We then move on to the generalized continuum hypothesis and prove that, as in classical set theory, it remains independent of the set theories we are discussing. In Section 6, we discuss cardinal arithmetic: cardinal addition, cardinal multiplication, and cardinal exponentiation and their properties. As a conclusion, in Section 7, we compare the non-classical set theories developed in this paper with
$\mathrm {IZF}$
and a paraconsistent set theory established in [Reference Weber14]. Finally, as a summary, we give an overview of the similarities of these non-classical set theories with the classical set theory.
2 Background: generalized algebra-valued models
Boolean-valued models of the classical set theory
$\mathrm {ZFC}$
were introduced by Dana Scott, Robert M. Solovay, and Petr Vopěnka in the 1960s to study Paul Cohen’s forcing in a different way. See [Reference Bell2] for the details of these models’ construction. This method of construction was used to construct generalized algebra-valued models of set theories in [Reference Löwe and Tarafder9].
2.1 Generalized algebra-valued models
Following [Reference Löwe and Tarafder9], we give an overview of generalized algebra-valued models of set theory. Consider the language
$\mathcal {L}$
of
$\mathrm {ZF}$
having the binary predicate symbol
$\in $
, connectives
$\wedge , \vee , \to , \lnot , \bot $
, and quantifiers
$\forall , \exists $
. Let
$\textbf{V}$
be a model of
$\mathrm {ZF}$
and
$\mathrm {ORD}$
be the class of all ordinal numbers in
$\textbf{V}$
. Let us now assume that
$\mathbb {A} = \langle \textbf {A}, \wedge , \vee , \Rightarrow , ^*, \textbf {1}, \textbf {0}\rangle $
is a complete distributive lattice, augmented with one binary operator
$\Rightarrow $
and one unary operator
$^*$
. Then a universe of names is defined by transfinite recursion as follows. For any
$\alpha \in \mathrm {ORD}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu1.png?pub-status=live)
After obtaining
$\textbf{V}^{(\mathbb {A})}$
, extend the language
$\mathcal {L}$
by adding a constant symbol for every element in
$\textbf{V}^{(\mathbb {A})}$
. The new language is denoted by
$\mathcal {L}_{\mathbb {A}}$
.
As usual, define an assignment function
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline39.png?pub-status=live)
from the class of all formulas in
$\mathcal {L}_{\mathbb {A}}$
to the set
$\textbf {A}$
of truth values as follows. If
$u,v \in \textbf{V}^{(\mathbb {A})}$
and
$\varphi , \psi $
are any two closed well-formed formulas in
$\mathcal {L}_{\mathbb {A}}$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu2.png?pub-status=live)
A filter
Footnote
1
$D \subseteq \textbf {A}$
will be called a designated set of
$\mathbb {A}$
. A formula
$\varphi $
of
$\mathcal {L}_{\mathbb {A}}$
is said to be D-valid in
$\textbf{V}^{(\mathbb {A})}$
, denoted by
$\textbf{V}^{(\mathbb {A})} \models _D \varphi $
or simply
$\textbf{V}^{(\mathbb {A})} \models \varphi $
(when the corresponding designated set is clear from the context), if
.
It is well known that if
$\mathbb {A}$
is a complete Boolean algebra then
$\textbf{V}^{(\mathbb {A})}$
becomes an algebra-valued model of
$\mathrm {ZF}$
, i.e.,
$\textbf{V}^{(\mathbb {A})} \models \mathrm {ZF}$
. This method of constructing a Boolean-valued model was first used by R. J. Grayson to produce an algebra-valued model of a non-classical set theory: if
$\mathbb {A}$
is a complete Heyting algebra then
$\textbf{V}^{(\mathbb {A})}$
becomes an algebra-valued model of
$\mathrm {IZF}$
, i.e.,
$\textbf{V}^{(\mathbb {A})} \models \mathrm {IZF}$
[Reference Grayson6].
Consider the following properties, viz. bounded quantification properties
$\mathrm {BQ}_{\varphi }$
, for every formula
$\varphi $
in
$\mathcal {L}$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqn1.png?pub-status=live)
If
$\mathbb {A}$
is a Boolean algebra or Heyting algebra, then
$\mathrm {BQ}_{\varphi }$
holds for every formula
$\varphi $
in
$\textbf{V}^{(\mathbb {A})}$
. However, it was proved in [Reference Löwe and Tarafder9] that there are algebras
$\mathbb {A}$
such that
$\mathrm {BQ}_{\varphi }$
does not hold in general in the algebra-valued models
$\textbf{V}^{(\mathbb {A})}$
.
2.2 Negation-free fragment
By
$\mathrm {NFF}$
, the negation-free fragment of
$\mathcal {L}$
, we mean the closure of the atomic formulas of
$\mathcal {L}$
under
$\wedge $
,
$\vee $
,
$\to $
,
$\bot $
,
$\exists $
, and
$\forall $
. The elements of
$\mathrm {NFF}$
are called negation-free formulas. By
$\mathrm {NFF}$
-
$\mathrm {ZF}$
and
$\mathrm {NFF}$
-
$\mathrm {ZF}^-$
we mean the negation-free fragment of
$\mathrm {ZF}$
and the negation-free fragment of
$\mathrm {ZF}$
excluding the
$\mathsf {Axiom \; of \; Foundation}$
,Footnote
2
respectively. The
$\mathsf {Axiom \; of \; Infinity}$
is taken as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu3.png?pub-status=live)
which makes it a negation-free formula. The
$\mathrm {NFF}$
-bounded quantification property (
$\mathrm {NFF}$
-
$\mathrm {BQ}_{\varphi }$
) stands for the bounded quantification property
$\mathrm {BQ}_{\varphi }$
for all negation-free formulas
$\varphi $
. Classically and intuitionistically, every formula is equivalent to a negation-free formula, as
$\lnot \varphi $
is equivalent to
$\varphi \to \bot $
. Hence, in these cases, we can conclude that
$\mathrm {NFF}$
-
$\mathrm {ZF}$
and
$\mathrm {NFF}$
-
$\mathrm {IZF}$
are equivalent to
$\mathrm {ZF}$
and
$\mathrm {IZF}$
, respectively.
2.3 The logic corresponding to an algebra
$\mathbb {A}$
and a designated set D
Let us consider an algebra
$\mathbb {A}$
and a designated set D of it. Let
$\mathsf {Prop}$
be the collection of all propositional formulas of the language having the same signature as
$\mathbb {A}$
. We know that a valuation is a homomorphism from
$\mathsf {Prop}$
into the algebra
$\mathbb {A}$
. The logic of
$(\mathbb {A}, D)$
, denoted by
$\textbf {L}(\mathbb {A}, D)$
, is defined as:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu4.png?pub-status=live)
2.4 Reasonable implication algebra
[Reference Löwe and Tarafder9, p. 194] An algebra
$\mathbb {A} := \langle \textbf {A}, \wedge , \vee , \Rightarrow , \textbf {1}, \textbf {0} \rangle $
is called a deductive reasonable implication algebra if
$\langle \textbf {A}, \wedge , \vee , \textbf {1}, \textbf {0} \rangle $
is a complete distributive lattice and the following properties hold: for any
$x, y, z \in \textbf {A}$
-
P1:
$(x\wedge y)\leq z$ implies
$x\leq (y\Rightarrow z)$ ,
-
P2:
$y\leq z$ implies
$(x\Rightarrow y)\leq (x\Rightarrow z)$ ,
-
P3:
$y\leq z$ implies
$(z\Rightarrow x)\leq (y\Rightarrow x)$ , and
-
P4:
$((x\wedge y)\Rightarrow z)=(x\Rightarrow (y\Rightarrow z))$ .
The following theorem gave rise to generalized algebra-valued models of set theories.
Theorem 1 [Reference Löwe and Tarafder9, Theorems 3.3 and 3.4]
If
$\mathbb {A}$
is a deductive reasonable implication algebra such that
$\mathrm {NFF}$
-
$\mathrm {BQ}_{\varphi }$
holds in
$\textbf{V}^{(\mathbb {A})}$
, then for any choice of the designated set D, we have
$\textbf{V}^{(\mathbb {A})} \models _D \mathrm {NFF}$
-
$\mathrm {ZF}^-$
.
3 Well-ordered algebra-valued models and ordinal-like elements
It was shown in [Reference Löwe and Tarafder9] that any complete Boolean algebra or complete Heyting algebra is a deductive reasonable implication algebra. However, there are reasonable implication algebras which are neither Boolean nor Heyting.
3.1 Well-ordered deductive reasonable implication algebra
Consider a lattice
$\langle \textbf {A}, \wedge , \vee \rangle $
. A binary relation
$\leq $
is uniquely defined on the lattice as follows:
$a \leq b$
iff
$a \wedge b = a$
, for all
$a, b \in \textbf {A}$
. The relation
$\leq $
is said to be the lattice order of the lattice considered. For any two elements
$a, b \in \textbf {A}$
, we define
$a < b$
iff
$a \leq b$
and
$a \neq b$
. The lattice order
$\leq $
is said to be well-ordered on
$\textbf {A}$
if
-
(i) it is totally-ordered: for any
$a, b \in \textbf {A}$ exactly one of
$a < b$ ,
$a = b$ , and
$b < a$ holds, and
-
(ii) for any non-empty
$X \subseteq \textbf {A}$ , there exists a least element with respect to the lattice order
$\leq $ , i.e., there exists an element
$a \in X$ such that for any
$b \in X$ ,
$a \leq b$ .
Definition 2. An algebra
$\mathbb {A} = \langle \textbf {A}, \wedge , \vee , \Rightarrow , \textbf {1}, \textbf {0} \rangle $
is called a well-ordered deductive reasonable implication algebra
$(\mathsf {WoDRIA})$
if the following conditions hold
$:$
-
(i)
$\langle \textbf {A}, \wedge , \vee , \textbf {1}, \textbf {0} \rangle $ is a bounded lattice having top and bottom elements
$\textbf {1}$ and
$\textbf {0}$ , respectively,
-
(ii) the lattice order
$\leq $ is a well-ordered relation on
$\textbf {A}$ , and
-
(iii) the operator
$\Rightarrow $ is defined by
$$ \begin{align*} a \Rightarrow b = \left \{ \begin{array}{ll} \textbf{0}, & \mbox{if } a \neq \textbf{0} \mbox{ and } b = \textbf{0}, \\ \textbf{1}, & \mbox{otherwise,} \end{array}\right. \end{align*} $$
$a, b \in \textbf {A}$ .
Lemma 3. Any
$\mathsf {WoDRIA}$
is a deductive reasonable implication algebra.
Proof. Let
$\mathbb {A} = \langle \textbf {A}, \wedge , \vee , \Rightarrow , \textbf {1}, \textbf {0} \rangle $
be a
$\mathsf {WoDRIA}$
. Then,
$\mathbb {A}$
is a complete distributive lattice. We shall prove that all the properties P1, P2, P3, and P4 will be satisfied by
$\mathbb {A}$
.
For P1: Let
$a, b, c \in \textbf {A}$
be such that
$a \wedge b \leq c$
. We have to prove that
$a \leq b \Rightarrow c$
. If
$b \Rightarrow c = \textbf {1}$
, then we are done. Let
$b \Rightarrow c = \textbf {0}$
, which implies that
$b \neq \textbf {0}$
and
$c = 0$
. Therefore, by our assumption,
$a = \textbf {0}$
. Hence, in any case, we conclude that
$a \leq b \Rightarrow c$
.
For P2: Let
$a \leq b$
holds in
$\textbf {A}$
. We have to prove that
$c \Rightarrow a \leq c \Rightarrow b$
, for any
$c \in \textbf {A}$
. If
$c \Rightarrow b = \textbf {1}$
, the proof is done. Suppose
$c \Rightarrow b = \textbf {0}$
. Then, by the definition of
$\Rightarrow $
,
$c \neq \textbf {0}$
and
$b = \textbf {0}$
. Since
$a \leq b$
, we have
$a = \textbf {0}$
also. Hence, it can be concluded that
$c \Rightarrow a = \textbf {0}$
. Therefore,
$c \Rightarrow a \leq c \Rightarrow b$
, for any
$c \in \textbf {A}$
.
For P3: Let us consider any
$a, b \in \textbf {A}$
which satisfy the property
$a \leq b$
. We shall prove that for any
$c \in \textbf {A}$
,
$b \Rightarrow c \leq a \Rightarrow c$
holds. Similar to the previous cases, there is nothing to prove if
$a \Rightarrow c = \textbf {1}$
. Hence, assume that
$a \Rightarrow c = \textbf {0}$
. This implies that
$a \neq \textbf {0}$
and
$c = \textbf {0}$
. Since, by our assumption,
$a \leq b$
, we get that
$b \neq \textbf {0}$
as well. Hence,
$b \Rightarrow c = \textbf {0}$
. So, in any case,
$b \Rightarrow c \leq a \Rightarrow c$
holds for any
$c \in \textbf {A}$
.
For P4: Let us consider any three elements
$a, b, c \in \textbf {A}$
. If
$(a \wedge b) \Rightarrow c = \textbf {0}$
, then
$a, b \neq \textbf {0}$
and
$c = \textbf {0}$
, which entails that
$a \Rightarrow (b \Rightarrow c) = \textbf {0}$
. Conversely, if
$a \Rightarrow (b \Rightarrow c) = \textbf {0}$
, we have
$a, b \neq \textbf {0}$
and
$c = \textbf {0}$
. Since
$\leq $
is a well-order (and hence linear-order) relation in
$\textbf {A}$
, either
$a \wedge b = a$
or
$a \wedge b = b$
. In either case,
$a \wedge b \neq \textbf {0}$
. Therefore,
$(a \wedge b) \Rightarrow c = \textbf {0}$
. Hence, we can conclude that,
$(a \wedge b) \Rightarrow c = \textbf {0}$
iff
$a \Rightarrow (b \Rightarrow c) = \textbf {0}$
. Since the range of the binary operator
$\Rightarrow $
is defined to be
$\{\textbf {1}, \textbf {0}\}$
, from the previous conclusion, we get that
$(a \wedge b) \Rightarrow c = \textbf {1}$
iff
$a \Rightarrow (b \Rightarrow c) = \textbf {1}$
. Combining both the results we finally have
$(a \wedge b) \Rightarrow c = a \Rightarrow (b \Rightarrow c)$
.⊣
If a
$\mathsf {WoDRIA}$
contains more than two elements then it can be neither a Boolean algebra nor a Heyting algebra. In [Reference Jockwich and Venturi7], the authors introduced totally ordered complete distributive lattices,
$\mathbb {L}$
. The domain of
$\mathbb {L}$
is a complete distributive lattice totally ordered by the relation
$\leq $
, and the lattices are equipped with the operator
$\Rightarrow $
as defined in Definition 2. Hence, every
$\mathsf {WoDRIA}$
is a totally ordered complete distributive lattice.
At this stage it is worth to observe that for any
$\mathsf {WoDRIA} \mathbb {A}$
and a pair of elements
$u, v \in \textbf{V}^{(\mathbb {A})}$
, the value of
is either
$\textbf {1}$
or
$\textbf {0}$
, due to the definitions of
and the operator
$\Rightarrow $
in a
$\mathsf {WoDRIA}$
. On the other hand, for any element a of
$\mathbb {A}$
there exist
$u, v \in \textbf{V}^{(\mathbb {A})}$
such that
, which can be witnessed by taking any
$u \in \textbf{V}^{(\mathbb {A})}$
and then by fixing an element
$v = \{\langle u, a \rangle \}$
of
$\textbf{V}^{(\mathbb {A})}$
.
Theorem 4 [Reference Jockwich and Venturi7]
If
$\mathbb {A}$
is a
$\mathsf {WoDRIA}$
then
$\mathrm {BQ}_{\varphi }$
holds in
$\textbf{V}^{(\mathbb {A})}$
for every negation-free formula
$\varphi $
.
As an application of Theorem 1, Lemma 3, and Theorem 4, if
$\mathbb {A}$
is a
$\mathsf {WoDRIA}$
then
$\textbf{V}^{(\mathbb {A})} \models _D \mathrm {NFF}$
-
$\mathrm {ZF}^-$
, for any designated set D. In addition, it can also be proved that
$\textbf{V}^{(\mathbb {A})} \models _D \mathrm {NFF}$
-
$\mathsf {Foundation}$
. Combining all these results we have the following theorem.
Theorem 5 [Reference Jockwich and Venturi7]
If
$\mathbb {A}$
is a
$\mathsf {WoDRIA}$
and D is any designated set of
$\mathbb {A}$
, then
$\textbf{V}^{(\mathbb {A})} \models _D \mathrm {NFF}$
-
$\mathrm {ZF}$
.
3.2 Negation introduction in
$\mathsf {WoDRIA}$
Until now we have discussed the validity of sentences in the negation-free fragment of
$\mathrm {ZF}$
. To explore full
$\mathrm {ZF}$
we need to introduce a unary operator
$^*$
in
$\mathsf {WoDRIA}$
which will be the algebraic interpretation of the connective
$\lnot $
in the language of set theory,
$\mathcal {L}$
.
Definition 6. Let
$\mathcal {PS}$
be the collection of all algebras
$\mathbb {A} = \langle \textbf {A}, \wedge , \vee , \Rightarrow , ^*, \textbf {1}, \textbf {0} \rangle $
satisfying the following conditions
$:$
-
(i)
$\langle \textbf {A}, \wedge , \vee , \Rightarrow , \textbf {1}, \textbf {0} \rangle $ is a
$\mathsf {WoDRIA}$ , and
-
(ii)
$^*$ is a unary operator on
$\textbf {A}$ which satisfies
$\textbf {1}^* = \textbf {0}$ ,
$\textbf {0}^* = \textbf {1}$ .
Any algebra
$\mathbb {A} \in \mathcal {PS}$
will be called a
$\mathcal {PS}$
-algebra.
The logic
$\textbf {L}(\mathbb {A}, D)$
of a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
will vary depending on the unary operator
$^*$
and the choice of the designated set D. The following are few such examples.
Example 1 (The logic is classical)
Note that, the
$\mathcal {PS}$
-algebra
$\mathbb {A}$
having two elements is the two-valued Boolean algebra. The only possible designated set in
$\mathbb {A}$
is
$D = \{\textbf {1}\}$
. Hence,
$\textbf {L}(\mathbb {A}, D)$
is the classical propositional logic.
Example 2 (The logic is an existing paraconsistent logic)
Consider the three-valued
$\mathcal {PS}$
-algebra
, where
. The designated set is taken as
. This algebra was introduced as a deductive reasonable implication algebra in [Reference Löwe and Tarafder9, p. 194] to produce a non-classical algebra-valued model of
$\mathrm {NFF}$
-
$\mathrm {ZF}$
. The logic
$\textbf {L}(\mathrm {PS}_3, D_{\mathrm {PS}_3})$
was studied in [Reference Tarafder, Chakraborty, Beziau, Chakraborty and Dutta12], which was named as
$\mathrm {LPS}_3$
. It was proved that the logic
$\mathrm {LPS}_3$
is a paraconsistent logic, which is sound and (weak) complete with respect to
$\mathrm {PS}_3$
[Reference Tarafder, Chakraborty, Beziau, Chakraborty and Dutta12].
Example 3 (The logic is both paraconsistent and paracomplete)
Consider any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and a designated set D such that the algebra contains more than two elements. If there exists a non-zero element
$a \in \textbf {A} \setminus D$
such that
$a^* = a$
, then clearly the logic
$\textbf {L}(\mathbb {A}, D)$
becomes paracomplete (as tertium non datur fails) and paraconsistent both. To have a concrete case, consider the three-valued algebra
$\mathrm {PS}_3$
itself. But, fix the designated set as
$D = \{\textbf {1}\}$
, instead of the set
. In this case,
and since
, we have that
. This implies that, if
$\varphi $
is a propositional formula assigned to the value
through a certain valuation function
$v: \mathsf {Prop} \to \mathrm {PS}_3$
, then
, which makes the formula
$\varphi \vee \neg \varphi $
invalid in the logic of
$\mathrm {PS}_3$
with respect to the designated set D, i.e.,
$\varphi \vee \neg \varphi \notin \textbf {L}(\mathrm {PS}_3, D)$
. On the other hand, if
$\psi $
be a propositional formula assigned to the element
$\textbf {0}$
of
$\mathrm {PS}_3$
by the same valuation function v, then
$v((\varphi \wedge \neg \varphi ) \to \psi ) = \textbf {0}$
. Hence,
$(\varphi \wedge \neg \varphi ) \to \psi \notin \textbf {L}(\mathrm {PS}_3, D)$
, which entails that the logic
$\textbf {L}(\mathrm {PS}_3, D)$
is paraconsistent.
Example 4 (The logic is paraconsistent but not paracomplete)
Consider any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and a designated set D containing more than one element such that the unary operator
$^*$
is defined as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu6.png?pub-status=live)
Let
$\varphi $
and
$\psi $
be two propositional formulas and v be a valuation from
$\mathsf {Prop}$
to
$\mathbb {A}$
such that
$v(\varphi ) = a_0$
, where
$a_0 \in D \setminus \{\textbf {1}\}$
, and
$v(\psi ) = \textbf {0}$
. Then,
$v((\varphi \wedge \neg \varphi ) \to \psi ) = \textbf {0}$
, which shows that
$(\varphi \wedge \neg \varphi ) \to \psi \notin \textbf {L}(\mathbb {A}, D)$
. Hence, the logic
$\textbf {L}(\mathbb {A}, D)$
is paraconsistent. On the other hand, it is clear that for any
$b \in \mathbb {A}$
,
$b \vee b^* \in D$
. Hence, for any
$\varphi \in \mathsf {Prop}$
,
$\varphi \vee \neg \varphi \in \textbf {L}(\mathbb {A}, D)$
, which proves that
$\textbf {L}(\mathbb {A}, D)$
is not paracomplete. The algebra
$\mathrm {PS}_3$
with the designated set
$D_{\mathrm {PS}_3}$
, explained in Example 2, is a particular case for this kind of example.
Example 5 (The logic is paracomplete but not paraconsistent)
Let
$\mathbb {A}$
be any
$\mathcal {PS}$
-algebra and D be its designated set such that
$\textbf {A} \setminus D$
contains more than one element and the unary operator
$^*$
is defined as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu7.png?pub-status=live)
Since for every
$a \in \textbf {A}$
,
$a \wedge a^* = \textbf {0}$
, for any
$\varphi , \psi \in \mathsf {Prop}$
and any valuation
$v: \mathsf {Prop} \to \textbf {A}$
, we have
$v((\varphi \wedge \neg \varphi ) \to \psi ) = \textbf {1}$
. Hence,
$(\varphi \wedge \neg \varphi ) \to \psi \in \textbf {L}(\mathbb {A}, D)$
, for all
$\varphi , \psi \in \mathsf {Prop}$
, which implies that
$\textbf {L}(\mathbb {A}, D)$
is not a paraconsistent logic. To prove that it is a paracomplete logic, let us consider a non-zero element
$a_0 \in \textbf {A} \setminus D$
. Suppose
$\varphi \in \mathsf {Prop}$
is such that with respect to a certain valuation v,
$v(\varphi ) = a_0$
. Then,
$v(\varphi \vee \neg \varphi ) = a_0 \notin D$
. Hence,
$\varphi \vee \neg \varphi \notin \textbf {L}(\mathbb {A}, D)$
, which shows that
$\textbf {L}(\mathbb {A}, D)$
is paracomplete. To have a specific case, consider the three-valued
$\mathcal {PS}$
-algebra
, where
. Let the designated set be
$D = \{\textbf {1}\}$
. Then, by the above argument,
$\textbf {L}(\mathbb {A}_3, D)$
is paracomplete but not paraconsistent.
Observation 7. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and any designated set D,
$\textbf{V}^{(\mathbb {A})} \models \mathrm {NFF}$
-
$\mathrm {ZF}$
, by Theorem 5, since any
$\mathcal {PS}$
-algebra is by definition a
$\mathsf {WoDRIA}$
. Moreover, if the logic
$\textbf {L}(\mathbb {A}, D)$
is non-classical then
$\textbf{V}^{(\mathbb {A})}$
becomes an algebra-valued model of a non-classical set theory.
3.3 Ordinal numbers in
$\mathcal {PS}$
-algebra-valued models
In [Reference Tarafder, Banerjee and Krishna11], ordinal numbers in the algebra-valued model
$\textbf{V}^{(\mathrm {PS}_3)}$
were developed by transfinite induction. More precisely, ordinal-like elements were defined. We shall now generalize the definition of ordinal-like elements in the
$\mathcal {PS}$
-algebra-valued models.
Definition 8. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra. An element
$x \in \textbf{V}^{(\mathbb {A})}$
is said to be
-
(i) 0-like if
$x(y) = \textbf {0}$ for every
$y \in \mathrm {dom}(x)$ ,
-
(ii)
$\alpha $ -like for some
$\alpha \in \mathrm {ORD}$ if for each
$\beta \in \alpha $ there exists a
$\beta $ -like
$y \in \mathrm {dom}(x)$ such that
$x(y) \in D$ , and for any
$z \in \mathrm {dom}(x)$ if it is not
$\beta $ -like for any
$\beta \in \alpha $ then
$x(z) = \textbf {0}$ , and
-
(iii) ordinal-like if it is
$\alpha $ -like for some
$\alpha \in \mathrm {ORD}$ .
Note that
$\varnothing $
is also a 0-like element and for every
$\alpha \in \mathrm {ORD}$
there are class many
$\alpha $
-like elements. Following the proofs of [Reference Tarafder, Banerjee and Krishna11, Theorem 9] and [Reference Tarafder, Banerjee and Krishna11, Theorem 10] the following theorem can be derived.
Theorem 9. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra and
$u \in \textbf{V}^{(\mathbb {A})}$
be
$\alpha $
-like for some
$\alpha \in \mathrm {ORD}$
. Then, independent of the choice of the designated set,
-
(i) for any
$v \in \textbf{V}^{(\mathbb {A})}$ ,
$\textbf{V}^{(\mathbb {A})} \models u = v $ if and only if v is
$\alpha $ -like, and
-
(ii) for any
$v \in \textbf{V}^{(\mathbb {A})}$ ,
$\textbf{V}^{(\mathbb {A})} \models v \in u$ if and only if v is
$\beta $ -like for some
$\beta \in \alpha $ .
We shall prove in Theorem 13 that ordinal-like elements are characterized by the first-order formula
$\mathsf {Ord}(x)$
, defined as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu8.png?pub-status=live)
where the abbreviations used in
$\mathrm {WO}_\in (x)$
are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu9.png?pub-status=live)
The formulas
$\mathrm {Trans}(x)$
,
$\mathrm {LO}(x)$
,
$\mathrm {WO}_\in (x)$
, and
$\mathsf {Ord}(x)$
naively state that ‘x is a transitive set’, ‘x is a linear ordered set’, ‘x is a well-ordered set with respect to
$\in $
’, and ‘x is an ordinal number’, respectively. In [Reference Tarafder, Banerjee and Krishna11, Theorem 13], it was proved that if u is an ordinal-like element, then
$\textbf{V}^{(\mathrm {PS}_3)} \models _{D_{\mathrm {PS}_3}} \mathsf {Ord}(u)$
. In this paper, we shall also prove the converse in the general set-up.
Definition 10. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra, D be a designated set of
$\mathbb {A}$
, and
$u \in \textbf{V}^{(\mathbb {A})}$
be an arbitrary element. Then a sub-collection
$\mathrm {dom}_D(u)$
of
$\mathrm {dom}(u)$
is defined as
$\mathrm {dom}_D(u) = \{x \in \mathrm {dom}(u) : u(x) \in D \}$
.
Theorem 11. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and designated set D, the class relation
$\sim $
on
$\textbf{V}^{(\mathbb {A})}$
, defined as
$u \sim v$
if and only if
$\textbf{V}^{(\mathbb {A})} \models u = v$
, is an equivalence relation.
Proof. That the relation
$\sim $
is reflexive and symmetric follows immediately from the definition of
. We shall now prove that
$\sim $
is transitive as well. Let us consider three elements
$u, v, w \in \textbf{V}^{(\mathbb {A})}$
such that
$u \sim v$
and
$v \sim w$
hold, i.e.,
. Hence, we get that
, as the only possible values of
and
are
$\textbf {1}$
and
$\textbf {0}$
. Then, it is enough to prove that
as well. If not, then without loss of generality, let there exists
$x_0 \in \mathrm {dom}(u)$
such that
. Hence,
$u(x_0) \neq \textbf {0}$
and
. Since, by our assumption,
and
$u(x_0) \neq \textbf {0}$
, we have
. Therefore, there exists
$y_0 \in \mathrm {dom}(v)$
such that
$v(y_0) \neq \textbf {0}$
and
. Hence, we can derive that
, as
. This implies that
. Hence, we get that
, which contradicts our assumption. Finally we can conclude that
. Hence,
$u \sim w$
holds. ⊣
Definition 12. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra and D be a designated set of
$\mathbb {A}$
. For every element
$u \in \textbf{V}^{(\mathbb {A})}$
the set
$\mathrm {Part}(\mathrm {dom}_D(u))$
is defined to be the quotient
$($
partition
$)$
of
$\mathrm {dom}_D(u)$
by the equivalence relation
$\sim $
, i.e.,
$\mathrm {Part}(\mathrm {dom}_D(u)) = \mathrm {dom}_D(u)/{\sim} $
.
Theorem 13. Let
$\mathbb {A}$
be an arbitrary
$\mathcal {PS}$
-algebra and D be any designated set. For an element
$u \in \textbf{V}^{(\mathbb {A})}$
,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Ord}(u)$
if and only if u is an
$\alpha $
-like element for some
$\alpha \in \mathrm {ORD}$
.
Proof. Following the proof of Theorem 13 of [Reference Tarafder, Banerjee and Krishna11], one can prove that if
$u \in \textbf{V}^{(\mathbb {A})}$
is an
$\alpha $
-like element for some
$\alpha \in \mathrm {ORD}$
, then
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Ord}(u)$
.
Conversely, let
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Ord}(u)$
for some
$u \in \textbf{V}^{(\mathbb {A})}$
. We shall prove that u is an
$\alpha $
-like element for some
$\alpha \in \mathrm {ORD}$
. If
$\mathrm {dom}_D(u)$
is empty then u is a 0-like element and the proof is complete. Hence, we assume that
$\mathrm {dom}_D(u)$
is non-empty. Since
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Trans}(u)$
, if
$v \in \mathrm {dom}_D(u)$
and
$w \in \mathrm {dom}_D(v)$
then
$w \in \mathrm {dom}_D(u)$
. This leads to the fact that there exists a 0-like element in
$\mathrm {dom}_D(u)$
. Also, if there exists a
$\beta $
-like element in
$\mathrm {dom}_D(u)$
for some
$\beta \in \mathrm {ORD}$
, then for every
$\gamma \in \beta $
there exists a
$\gamma $
-like element in
$\mathrm {dom}_D(u)$
. Using this fact and the case that every element of
$\textbf{V}^{(\mathbb {A})}$
is sets (not proper classes) in
$\textbf{V}$
, we can say that there exists
$\alpha \in \mathrm {ORD}$
such that for every
$\beta \in \alpha $
, there exists at least one
$\beta $
-like element in
$\mathrm {dom}_D(u)$
, but there does not exist any
$\gamma $
-like element in
$\mathrm {dom}_D(u)$
where
$\gamma = \alpha $
or
$\alpha \in \gamma $
. If
$\mathrm {dom}_D(u)$
does not contain any other element then u is an
$\alpha $
-like element and hence the proof is complete. If possible, let
$\mathrm {dom}_D(u)$
contain an element
$x_i$
which is not a
$\beta $
-like element for any
$\beta \in \alpha $
. Since
$\textbf{V}^{(\mathbb {A})} \models \mathrm {LO}(u)$
,
$\mathrm {dom}_D(x_i)$
contains a
$\beta $
-like element for each
$\beta \in \alpha $
. But, by a similar argument, it contains an element
$x_j$
which is not
$\beta $
-like for any
$\beta \in \alpha $
. But
$x_j \in \mathrm {dom}_D(u)$
. Continuing the process, we get a subset
$\{ x_i: i \in \Lambda \}$
of
$\mathrm {dom}_D(u)$
, where
$\Lambda $
is an index set such that
-
(i) for every
$i \in \Lambda $ ,
$x_i$ is not
$\beta $ -like for any
$\beta \in \alpha $ , and
-
(ii) for every
$i \in \Lambda $ ,
$x_i$ contains a
$\beta $ -like element for each
$\beta \in \alpha $ .
Now consider an element
$y \in \textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}(y) = \{ x_i: i \in \Lambda \}$
and
$\mathrm {ran}(y) = \{\textbf {1}\}$
. Then
$\textbf{V}^{(\mathbb {A})} \models y \subseteq u ~ \wedge ~ (y \neq \varnothing )$
. Since
$\textbf{V}^{(\mathbb {A})} \models \mathrm {WO}_\in (u)$
, the second conjunct of
$\mathrm {WO}_\in (u)$
is also valid in
$\textbf{V}^{(\mathbb {A})}$
. So, there exists an element
$z \in \textbf{V}^{(\mathbb {A})}$
such that for some
$k \in \Lambda $
,
and
$\mathrm {dom}_D(z)$
does not contain any element which is equal to
$x_i$
for any
$i \in \Lambda $
. This fact and the construction of
$x_k$
show that
$\mathrm {dom}_D(x_k)$
contains at least one
$\beta $
-like element for each
$\beta \in \alpha $
and nothing else. Hence, from the definition, we get that
$x_k$
is an
$\alpha $
-like element. Moreover, by our construction,
$x_k \in \mathrm {dom}_D(u)$
. This contradicts the fact that
$\mathrm {dom}_D(u)$
does not contain any
$\alpha $
-like element. Hence, the proof is complete. ⊣
4 Natural numbers and mathematical induction
In this section, we explore the first-order formulas corresponding to the natural numbers and prove that for each natural number n, the domain of definition of the formula representing the natural number n contains precisely the n-like elements. We show that mathematical induction holds in
$\textbf{V}^{(\mathbb {A})}$
for any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and designated set D.
4.1 Natural number-like elements
The formula
$\mathsf {Empty}_\exists (x) := \lnot\exists y (y \in x)$
represents the empty set in classical set theory. But there exists a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and a designated set D such that the domain of
$\mathsf {Empty}_\exists (x)$
does not contain only
$0$
-like elements in the corresponding
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
. For example, consider a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and an element
$u \in \textbf{V}^{(\mathbb {A})}$
so that
$\mathrm {ran}(u) = \{a\}$
, where both
$a, a^* \in D$
. Clearly, u is not a 0-like element but it validates the formula
$\mathsf {Empty}_\exists (x)$
in
$\textbf{V}^{(\mathbb {A})}$
. Moreover, u validates
$\neg \mathsf {Empty}_\exists (x)$
as well. From now on, we shall consider the formula
$\mathsf {Empty}(x): = \exists y (y \in x) \to \bot $
as the first-order representation of the empty set in any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
. Observe that if classical set theory or intuitionistic set theory is concerned,
$\mathsf {Empty}(x)$
and
$\mathsf {Empty}_\exists (x)$
are equivalent.
Let
$\mathsf {Nat}(0,x)$
be the abbreviation for the formula
$\mathsf {Empty}(x)$
. Then for a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and
$u \in \textbf{V}^{(\mathbb {A})}$
,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(0,u)$
if and only if u is a
$0$
-like element, corresponding to any designated set D. For each positive natural number n, we shall recursively define the formula
$\mathsf {Nat}(n,x)$
, which uniquely represents the natural number n in classical set theory. For each
$n \in \omega $
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu10.png?pub-status=live)
Theorem 14. Let
$n \in \omega $
be arbitrarily chosen. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
, designated set D, and
$u \in \textbf{V}^{(\mathbb {A})}$
,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(n+1, u)$
if and only if u is an
$(n+1)$
-like element in
$\textbf{V}^{(\mathbb {A})}$
.
Proof. The theorem will be proved by meta-induction. Let us arbitrarily fix a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
with a designated set D.
Base step: Consider the case for
$n = 0$
. We need to prove that the 1-like elements are the only instances of the formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu11.png?pub-status=live)
So
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(1,x)$
if and only if there exists
$u \in \textbf{V}^{(\mathbb {A})}$
such that
,
,
.
-
(i)
if and only if u is 0-like.
-
(ii)
, i.e.,
, if and only if there exists
$t \in \mathrm {dom}_D(x)$ such that
, i.e., t is 0-like, using Theorem 9(i).
-
(iii)
, i.e.,
, if and only if for each
$t \in \mathrm {dom}_D(x)$ ,
, i.e., t is 0-like.
Hence, combining (i), (ii), and (iii), it can be concluded that
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(1, u)$
if and only if u is a
$1$
-like element.
Induction hypothesis: Let the proposition be true for all natural numbers less than
$m \in \omega \setminus \{0\}$
, i.e., for
$u \in \textbf{V}^{(\mathbb {A})}$
,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(k, u)$
if and only if u is a k-like element for each
$k \in \{1, 2, \ldots , m\}$
.
Induction step: We shall prove the proposition for the natural number m. Hence, we have to prove
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(m+1, u)$
if and only if u is an (
$m+1$
)-like element. Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu12.png?pub-status=live)
if and only if there exist
$u_0, u_1, \ldots , u_m \in \textbf{V}^{(\mathbb {A})}$
such that
-
(i)
,
-
(ii)
, and
-
(iii)
.
By the induction hypothesis, (i) holds if and only if each
$u_i$
is an i-like element where
$i \in \{0, 1, \ldots , m\}$
. Condition (ii) holds if and only if for each
$i \in \{0, 1, 2, \ldots , m\}$
there exists an i-like element, in
$\mathrm {dom}_D(u)$
. Condition (iii) holds if and only if every
$y \in \mathrm {dom}_D(u)$
is i-like for some
$i \in \{0, 1, 2, \ldots , m\}$
. Hence,
if and only if u is an (
$m+1$
)-like element, which entails that the proposition also holds for m. Therefore, by the principle of mathematical induction, the proposition holds for all
$n \in \omega $
. ⊣
We next prove that in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, the successor of an n-like element will be an
$(n+1)$
-like element, for any
$n \in \omega $
.
Proposition 15. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
, any designated set D, and a natural number n,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu13.png?pub-status=live)
Proof. Let us take an n-like element x for some
$n \in \omega $
. Now let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu14.png?pub-status=live)
From the first conjunct we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline631.png?pub-status=live)
, which implies that for any
$y \in \textbf{V}^{(\mathbb {A})}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline633.png?pub-status=live)
, i.e.,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu15.png?pub-status=live)
i.e., any
$z \in \mathrm {dom}_D(y)$
is either an m-like element, where
$m < n$
, or an n-like element.
The second conjunct gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline636.png?pub-status=live)
This implies that for any
$y \in \textbf{V}^{(\mathbb {A})}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline638.png?pub-status=live)
, i.e.,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu16.png?pub-status=live)
i.e., for any
$z \in \textbf{V}^{(\mathbb {A})}$
which is either m-like for some
$m < n$
or n-like, there exists
$t \in \mathrm {dom}_D(y)$
which is either m-like or n-like.
Combining the above two derivations, we can say that if x is any n-like element and
holds, then by definition, y is an
$(n+1)$
-like element. This completes the proof. ⊣
4.2 Mathematical induction
In classical set theory we know that the smallest inductive set is the collection of all natural numbers,
$\omega $
. By Definition 8, we know that in any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, if u is an
$\omega $
-like element, then
$\mathrm {dom}_D(u)$
contains at least one natural-number-like element for every natural number in
$\omega $
and nothing else. However, from this fact it is not immediate that an
$\omega $
-like element is the smallest inductive set in
$\textbf{V}^{(\mathbb {A})}$
. Theorem 19 confirms that this is the case, which also leads to the validity of mathematical induction in
$\textbf{V}^{(\mathbb {A})}$
.
Consider the following three formulas:
-
(i)
$\mathrm {Ind}(I) := \exists e (\mathrm {Nat}(0, e) \wedge e \in I) \wedge \forall x (x \in I \rightarrow \exists s \forall y (y \in s \leftrightarrow y \in x \vee y = x) \wedge s \in I)$ ,
-
(ii)
$\mathsf {Nat}(x) := \forall I (\mathrm {Ind}(I) \rightarrow x \in I)$ , and
-
(iii)
$\mathrm {SetNat}(w) := \forall x (x \in w \leftrightarrow \mathsf {Nat}(x))$ .
Intuitively, the formula
$\mathrm {Ind}(I)$
is naively interpreted as ‘I is inductive’,
$\mathsf {Nat}(x)$
is interpreted as ‘x belongs to every inductive set’, i.e., in the sense of classical set theory we can think of the formula
$\mathsf {Nat}(x)$
as expressing that x is a natural number, and the formula
$\mathrm {SetNat}(w)$
is interpreted as ‘w consists of all natural numbers’.
Intuitively, Lemma 16 portrays that if
$I \in \textbf{V}^{(\mathbb {A})}$
is an inductive set and there does not exist any m-like element (where
$m \in \omega \setminus \{0$
}) in I, then I does not contain any
$(m-1)$
-like element.
Lemma 16. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra and D be any designated set of
$\mathbb {A}$
. Suppose
$I \in \textbf{V}^{(\mathbb {A})}$
is an element which satisfies the following two conditions
$:$
-
(i)
, and
-
(ii) for an arbitrary
$m \in \omega \setminus \{0\}$ there does not exist any m-like element
$v \in \mathrm {dom}_D(I)$ .
Then there does not exist any
$(m-1)$
-like element
$u \in \mathrm {dom}_D(I)$
.
Proof. If possible, let u be an
$(m-1)$
-like element such that
$u \in \mathrm {dom}_D(I)$
. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu17.png?pub-status=live)
Condition (i) and
$I(u) \in D$
together imply
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu18.png?pub-status=live)
i.e., there exists
$v \in \textbf{V}^{(\mathbb {A})}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu19.png?pub-status=live)
which implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline677.png?pub-status=live)
. Using Theorem 9 the first conjunct assures that v is m-like. The second conjunct implies
$I(v) \in D$
. This contradicts condition (ii). Hence, the proof is complete.⊣
Lemma 17. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and any designated set D, if
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Ind}(I)$
for some
$I \in \textbf{V}^{(\mathbb {A})}$
then for each natural number n there exists an n-like element
$u \in \mathrm {dom}_D(I)$
.
Proof. Let us consider an
$I \in \textbf{V}^{(\mathbb {A})}$
such that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Ind}(I)$
, i.e., both the conjuncts of
$\mathrm {Ind}(I)$
are valid in
$\textbf{V}^{(\mathbb {A})}$
. Hence, from the first conjunct there exists a 0-like element in
$\mathrm {dom}_D(I)$
. Since the second conjunct is also valid, by Lemma 16 it can be concluded that for a natural number m in
$\textbf{V}$
, if there exists an m-like element
$u \in \mathrm {dom}_D(I)$
then there exists an
$(m+1)$
-like element
$v \in \mathrm {dom}_D(I)$
. Hence, by meta-induction on natural numbers in
$\textbf{V}$
, the proof is complete.⊣
Lemma 17 shows that every inductive set contains all the natural numbers in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
. Hence, in
$\textbf{V}^{(\mathbb {A})}$
, the intersection of all inductive sets should be the collection of all natural numbers. This is confirmed by Theorem 18.
Theorem 18. For any
$u \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Nat}(u)$
if and only if u is n-like for some natural number n, corresponding to any designated set D of
$\mathbb {A}$
.
Proof. Let u be an n-like element for some
$n \in \omega $
. We get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu20.png?pub-status=live)
since for each
$I \in \textbf{V}^{(\mathbb {A})}$
, if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline704.png?pub-status=live)
then by Lemma 17 we also get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline705.png?pub-status=live)
.
Conversely, let
. Hence, for each
$I \in \textbf{V}^{(\mathbb {A})}$
, if
then
. We shall show that x is a natural-number-like element. Consider an
$\omega $
-like element
$u \in \textbf{V}^{(\mathbb {A})}$
. Then
is immediate. But if x is not a natural-number-like element then using Lemma 17 we get
. This implies that x is a natural-number-like element and the theorem is proved.⊣
As an application of Theorem 18 we get the following theorem, which ensures that the smallest inductive set is an
$\omega $
-like element in any
$\textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A} \in \mathcal {PS}$
.
Theorem 19. For any
$u \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra,
$\textbf{V}^{(\mathbb {A})} \models \mathrm {SetNat}(u)$
if and only if u is an
$\omega $
-like element, with respect to any designated set D of
$\mathbb {A}$
.
Following the principle of mathematical induction in classical set theory, we can intuitively think about the same principle in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
as follows: for any two names
$x, y \in \textbf{V}^{(\mathbb {A})}$
, if x is an
$\omega $
-like element, y is a subset of x in
$\textbf{V}^{(\mathbb {A})}$
, and y is inductive, then
$x = y$
holds in
$\textbf{V}^{(\mathbb {A})}$
. Let us now consider the formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqn2.png?pub-status=live)
In the following theorem we shall prove that mathematical induction holds in every
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
even if the logic of
$(\mathbb {A}, D)$
is non-classical.
Theorem 20. The formula
$\mathsf {MI}$
is valid in any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, i.e.,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {MI}$
, corresponding to any designated set D of
$\mathbb {A}$
.
Proof. Consider any
$x, y \in \textbf{V}^{(\mathbb {A})}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline739.png?pub-status=live)
. We shall prove
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline740.png?pub-status=live)
, i.e., y is an
$\omega $
-like element. Using Theorem 19,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline742.png?pub-status=live)
implies that x is an
$\omega $
-like element. From the second conjunct we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline744.png?pub-status=live)
, which implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu21.png?pub-status=live)
Since x is
$\omega $
-like, if there exists
$t \in \mathrm {dom}(y)$
which is not a natural-number-like element then
$y(t) \notin D$
. The third conjunct of our assumption gives us that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline748.png?pub-status=live)
. Then, using Lemma 17, we get that for each natural number n there exists an n-like element in
$\mathrm {dom}_D(y)$
. These results together show that y is an
$\omega $
-like element. ⊣
5 Axiom of Choice, cardinality, and GCH in
$\mathcal {PS}$
-algebra-valued models
In this section, we explore the cardinality of an element in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
following the construction of cardinality in classical set theory. It will be shown that the properties of cardinality in
$\textbf{V}^{(\mathbb {A})}$
mostly depend on the properties in
$\textbf{V}$
.
To avoid repetition, from now on by saying ‘for any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
(any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
)’ we shall mean that ‘any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
, associated with any designated set D of it (any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
where
$\mathbb {A}$
is associated with any designated set D)’.
5.1 The Axiom of Choice and the Well-Ordering Theorem in
$\textbf{V}^{(\mathbb {A})}$
It is already discussed that all the axioms of
$\mathrm {NFF}$
-
$\mathrm {ZF}$
are valid in
$\textbf{V}^{(\mathbb {A})}$
, for every
$\mathcal {PS}$
-algebra
$\mathbb {A}$
. In this section, we shall prove that the
$\mathsf {Axiom~ of~ Choice}$
is also valid in
$\textbf{V}^{(\mathbb {A})}$
if it is valid in the ground model
$\textbf{V}$
. The validity of the
$\mathsf {Axiom~ of~ Choice}$
will be needed in defining cardinality in the
$\mathcal {PS}$
-algebra-valued models
$\textbf{V}^{(\mathbb {A})}$
.
To proceed further, we shall use the following abbreviations:Footnote 3
-
(i)
$\textbf {z = \{x\}} := \exists y \; (y \in z) \wedge \forall y \; (y \in z \rightarrow y = x)$ ,
-
(ii)
$\textbf {z = \{x, y\}} := \exists s \; (s \in z \wedge s = x) \wedge \exists t \; (t \in z \wedge t = y) \wedge \forall w \; (w \in z \rightarrow w = x \vee w = y)$ ,
-
(iii)
$\mathrm {Pair}(z; x, y):= \exists s \; (s \in z \wedge (\textbf {s = \{x\}})) \wedge \exists t \; (t \in z \wedge (\textbf {t = \{x, y\}}))\kern3pt\wedge $
$ \forall w \; (w \in z \rightarrow (\textbf {w = \{x\}}) \vee (\textbf {w = \{x, y\}}))$ ,
-
(iv)
$\mathrm {Func}(f):= \forall x \; (x \in f \rightarrow \exists s \; \exists t \; \mathrm {Pair}(x; s, t)) \wedge \forall x \; \forall y \; \forall s \; \forall t \; \forall w \; \forall w' ((x \in f \wedge y \in f \wedge $
$ \mathrm {Pair}(x; w, s) \wedge \mathrm {Pair}(y; w', t) \wedge w = w') \rightarrow s = t)$ ,
-
(v)
$\mathrm {Dom}(f; x):= \forall y \; (y \in x \rightarrow \exists w \; \exists z \; (w \in f \wedge \mathrm {Pair}(w; y, z)))\kern3pt\wedge $
$ \forall w \; (w \in f \rightarrow \exists y \; \exists z \; \mathrm {Pair}(w; y, z) \wedge y \in x)$ ,
-
(vi)
$\mathrm {Codom}(f;x):= \forall y \; (y \in x \rightarrow \exists w \; \exists z \; (w \in f \wedge \mathrm {Pair}(w; y, z)))\kern3pt\wedge $
$ \forall w \; (w \in f \rightarrow \exists y \; \exists z \; \mathrm {Pair}(w; y, z) \wedge z \in x)$ ,
-
(vii)
$\mathrm {InjFunc}(f; x, y):= \mathrm {Func}(f) \wedge \mathrm {Dom}(f; x) \wedge \mathrm {Codom}(f;y) \wedge \forall x \; \forall y \; \forall s \; \forall t {\forall p \; \forall q ((x {{\kern-1pt}\in{\kern-1pt}} f \wedge y {{\kern-1pt}\in{\kern-1pt}} f \wedge \mathrm {Pair}(x; s, t) \wedge \mathrm {Pair}(y; p, q) \wedge (t = q)) \rightarrow (s = p))}$ ,
-
(viii)
$\mathrm {SurFunc}(f;x, y):= \mathrm {Func}(f) \wedge \mathrm {Dom}(f;x) \wedge \mathrm {Codom}(f;y)\kern3pt\wedge $
$ \forall z \; (z \in y \rightarrow \exists s \; \exists w \; (w \in f \wedge s \in x \wedge \mathrm {Pair}(w; s, z)))$ , and
-
(ix)
$\mathrm {BijFunc}(f;x, y):= \mathrm {InjFunc}(f;x, y) \wedge \mathrm {SurFunc}(f;x, y)$ .
The formulas
$\textbf {z = \{x\}}$
and
$\textbf {z = \{x, y\}}$
are naively interpreted as ‘z is a singleton set
$\{x\}$
’ and ‘z is the set
$\{x, y\}$
’, respectively. Observe that the possibility of the sets x and y being equal is alive in the formula
$\textbf {z = \{x, y\}}$
. Naive interpretations of the formulas
$\mathrm {Func}(f)$
,
$\mathrm {Dom}(f;x)$
,
$\mathrm {Codom}(f;x)$
,
$\mathrm {InjFunc}(f;x, y)$
,
$\mathrm {SurFunc}(f;x, y)$
, and
$\mathrm {BijFunc}(f;x, y)$
are ‘f is a function’, ‘x is the domain of f’, ‘x is a co-domain of f’, ‘f is an injective function from x into y’, ‘f is a surjective function from x onto y’, and ‘f is a bijective function from x to y’, respectively.
Definition 21. An element
$w \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra and D is an arbitrarily fixed designated set of
$\mathbb {A}$
, is said to be
$(a, b)$
-like for some
$a, b \in \textbf{V}^{(\mathbb {A})}$
if
-
(i) there exists
$p \in \mathrm {dom}_D(w)$ such that any element in
$\mathrm {dom}_D(p)$ is equivalent to a with respect to
$\sim $ ,
-
(ii) there exists
$p \in \mathrm {dom}_D(w)$ such that
$\mathrm {dom}_D(p)$ contains two elements u and v such that
$u \sim a$ and
$v \sim b;$ moreover, any element in
$\mathrm {dom}_D(p)$ is either equivalent to a or equivalent to b,
-
(iii)
$\mathrm {dom}_D(w)$ does not contain any element other than those described in
$(\mathrm {i})$ and
$(\mathrm {ii})$ .
The first-order formula defining the
$\mathsf {Axiom~of~Choice}$
is given below:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_deqn34.png?pub-status=live)
where, as earlier,
$u \neq \varnothing $
and
$x \neq \varnothing $
are the abbreviations for the formulas
$\exists z (z \in u)$
and
$\exists z (z \in x)$
, respectively.
Theorem 22. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
, if
$\textbf{V} \models \mathrm {AC}$
then
$\textbf{V}^{(\mathbb {A})} \models \mathrm {AC}$
.
Proof. Let us consider a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
with a designated set D and a model of set theory
$\textbf{V}$
such that
$\textbf{V} \models \mathrm {AC}$
. Suppose
$u \in \textbf{V}^{(\mathbb {A})}$
be an arbitrary element such that
$\textbf{V}^{(\mathbb {A})} \models u \neq \varnothing $
. Then, we have
$\mathrm {dom}_D(u) \neq \varnothing $
in
$\textbf{V}$
. Let us take an element
$\bar {x} \in \mathrm {Part}(\mathrm {dom}_D(u))$
.
Case I. Suppose
$\bar {x}$
does not contain 0-like elements. Arbitrarily fix an element
$a_{\bar {x}} \in \bar {x}$
. By our assumption
$\mathrm {dom}_D(a_{\bar {x}}) \neq \varnothing $
and hence choose an element
$b_{\bar {x}} \in \mathrm {dom}_D(a_{\bar {x}})$
. Construct two elements
$p_{\bar {x}}$
and
$q_{\bar {x}}$
in
$\textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}(p_{\bar {x}}) = \{a_{\bar {x}}\}$
and
$\mathrm {dom}(q_{\bar {x}}) = \{a_{\bar {x}}, b_{\bar {x}}\}$
, where
$\mathrm {ran}(p_{\bar {x}}) = \{\textbf {1}\} = \mathrm {ran}(q_{\bar {x}})$
. Using these elements
$p_{\bar {x}}$
and
$q_{\bar {x}}$
we define another element
$w_{\bar {x}} \in \textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}(w_{\bar {x}}) = \{p_{\bar {x}}, q_{\bar {x}}\}$
and
$\mathrm {ran}(w_{\bar {x}}) = \{\textbf {1}\}$
. Hence by Definition 21, it can be said that
$w_{\bar {x}}$
is an
$(a_{\bar {x}}, b_{\bar {x}})$
-like element.
Case II. Suppose
$\bar {x}$
contains a 0-like element. Then by Theorem 9(i), all the elements of
$\bar {x}$
are 0-like elements. Hence,
$\bar {x}$
is the class of all 0-like elements of
$\mathrm {dom}_D(u)$
. Let us arbitrarily fix any two 0-like elements
$s, t \in \textbf{V}^{(\mathbb {A})}$
, not necessarily different in
$\textbf{V}$
. Following the same construction as in Case I, construct an element
$w_{\bar {x}} \in \textbf{V}^{(\mathbb {A})}$
such that it becomes an
$(s, t)$
-like element.
Let us now consider an element f such that
$\mathrm {dom}(f) = \{w_{\bar {x}}~:~\bar {x} \in \mathrm {Part}(\mathrm {dom}_D(u))\}$
and
$\mathrm {ran}(f) = \{\textbf {1}\}$
. The existence of f in
$\textbf{V}$
is assured by the fact that
$\textbf{V} \models \mathrm {AC}$
. Then by the construction
$f \in \textbf{V}^{(\mathbb {A})}$
. It can be checked that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Func}(f) \wedge \mathrm {Dom}(f; u)$
. We shall now prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu22.png?pub-status=live)
Consider an element
$v \in \textbf{V}^{(\mathbb {A})}$
such that
. Then, there exists an element
$x \in \mathrm {dom}_D(u)$
such that
$\textbf{V}^{(\mathbb {A})} \models v = x$
, and x is not 0-like. Consider the equivalence class
$\bar {x}$
containing x in
$\mathrm {Part}(\mathrm {dom}_D(u))$
. By the construction of f, there exists
$w_{\bar {x}} \in \mathrm {dom}(f)$
which is an
$(a_{\bar {x}}, b_{\bar {x}})$
-like element, where
$a_{\bar {x}} \in \bar {x}$
and
$b_{\bar {x}} \in \mathrm {dom}_D(a_{\bar {x}})$
. Since
$a_{\bar {x}} \in \bar {x}$
, we get that
$\textbf{V}^{(\mathbb {A})} \models a_{\bar {x}} = x$
, which implies
$\textbf{V}^{(\mathbb {A})} \models a_{\bar {x}} = v$
. Hence, we can derive that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Pair}(w_{\bar {x}}; v, b_{\bar {x}}) \wedge w_{\bar {x}} \in f \wedge b_{\bar {x}} \in v$
. Hence combining all the above results we can finally conclude that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {AC}$
.⊣
Unless otherwise stated, from now on we shall assume that the ground model
$\textbf{V}$
is a model of
$\mathrm {ZFC}$
. In this paper, the results on cardinality heavily depend on Theorem 23, which shows how the bijection between two elements u and v in
$\textbf{V}^{(\mathbb {A})}$
depends on the bijection between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\mathrm {Part}(\mathrm {dom}_D(v))$
in
$\textbf{V}$
, and similarly for the injection and surjection.
Theorem 23. For any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
and a pair of elements
$u, v \in \textbf{V}^{(\mathbb {A})}$
,
-
(i) there exists an injection from
$\mathrm {Part}(\mathrm {dom}_D(u))$ into
$\mathrm {Part}(\mathrm {dom}_D(v))$ in
$\textbf{V}$ if and only if
$\textbf{V}^{(\mathbb {A})} \models \exists f~ \mathrm {InjFunc}(f;u, v)$ ,
-
(ii) there exists a surjection from
$\mathrm {Part}(\mathrm {dom}_D(u))$ onto
$\mathrm {Part}(\mathrm {dom}_D(v))$ in
$\textbf{V}$ if and only if
$\textbf{V}^{(\mathbb {A})} \models \exists f~ \mathrm {SurjFunc}(f;u, v)$ ,
-
(iii) there exists a bijection between
$\mathrm {Part}(\mathrm {dom}_D(u))$ and
$\mathrm {Part}(\mathrm {dom}_D(v))$ in
$\textbf{V}$ if and only if
$\textbf{V}^{(\mathbb {A})} \models \exists f~ \mathrm {BijFunc}(f;u, v)$ .
Proof. We shall prove (iii) only; statements (i) and (ii) can be proved similarly. Let
$g : \mathrm {Part}(\mathrm {dom}_D(u)) \rightarrow \mathrm {Part}(\mathrm {dom}_D(v))$
be a bijection in
$\textbf{V}$
. Let
$\bar {x} \in \mathrm {Part}(\mathrm {dom}_D(u))$
be arbitrarily chosen and
$ a \in \bar {x}$
and
$b \in g(\bar {x})$
be arbitrarily fixed elements. Then, by definition,
$a, b \in \textbf{V}^{(\mathbb {A})}$
. Consider two elements
$p, q \in \textbf{V}^{(\mathbb {A})}$
, defined by
$\mathrm {dom}(p) = \{a\}$
,
$\mathrm {dom}(q) = \{a, b\}$
, and
$\mathrm {ran}(p) = \{\textbf {1}\} = \mathrm {ran}(q)$
. Let us now take the element
$w_{\bar {x}}$
of
$\textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}(w_{\bar {x}}) = \{p, q\}$
and
$\mathrm {ran}(w_{\bar {x}}) = \{ \textbf {1} \}$
. It can be proved that
$w_{\bar {x}}$
is (
$a, b$
)-like. Clearly, for each
$\bar {x} \in \mathrm {Part}(\mathrm {dom}_D(u))$
, we have one element
$w_{\bar {x}}$
which is (
$a, b$
)-like for some
$a \in \bar {x}$
and
$b \in g(\bar {x})$
. Now consider
$f \in \textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}(f) = \{w_{\bar {x}} : \bar {x} \in \mathrm {Part}(\mathrm {dom}_D(u))\}$
and
$\mathrm {ran}(f) = \{ \textbf {1} \}$
; such a function f exists in
$\textbf{V}$
, and hence in
$\textbf{V}^{(\mathbb {A})}$
, since
$\textbf{V} \models \mathrm {AC}$
. By the definition, it is immediate that
.
Conversely, let
$\textbf{V}^{(\mathbb {A})} \models \exists f \; \mathrm {BijFunc}(f;u, v)$
. We shall prove that there exists a bijection between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\mathrm {Part}(\mathrm {dom}_D(v))$
. By the assumption, there exists
$f \in \textbf{V}^{(\mathbb {A})}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu23.png?pub-status=live)
By analysing all these, we conclude the following.
-
(i) If
$w \in \mathrm {dom}_D(f)$ then w is (
$a, b$ )-like for some
$a, b \in \textbf{V}^{(\mathbb {A})}$ .
-
(ii) For any
$w, w' \in \mathrm {dom}_D(f)$ , if w is (
$a, b$ )-like and
$w'$ is (
$c, d$ )-like for some
$a, b, c, d \in \textbf{V}^{(\mathbb {A})}$ , where
$a \sim c$ holds, then
$b \sim d$ also holds.
-
(iii) For every
$a \in \mathrm {dom}_D(u)$ there exist
$w \in \mathrm {dom}_D(f)$ and
$b \in \textbf{V}^{(\mathbb {A})}$ such that w is (
$a, b$ )-like.
-
(iv) For every
$w \in \mathrm {dom}_D(f)$ there exist
$a \in \mathrm {dom}_D(u)$ and
$b \in \textbf{V}^{(\mathbb {A})}$ such that w is (
$a, b$ )-like.
-
(v) For every
$w \in \mathrm {dom}_D(f)$ there exist
$b \in \mathrm {dom}_D(v)$ and
$a \in \textbf{V}^{(\mathbb {A})}$ such that w is (
$a, b$ )-like.
-
(vi) For any
$w, w' \in \mathrm {dom}_D(f)$ and
$a, b, c, d \in \textbf{V}^{(\mathbb {A})}$ if w is (
$a, b$ )-like,
$w'$ is (
$c, d$ )-like, and
$b \sim d$ , then
$a \sim c$ .
-
(vii) If
$b \in \mathrm {dom}_D(v)$ then there exist
$a \in \mathrm {dom}_D(u)$ and
$w \in \mathrm {dom}_D(f)$ such that w is (
$a, b$ )-like.
Combining all these results, we get a bijection between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\mathrm {Part}(\mathrm {dom}_D(v))$
in
$\textbf{V}$
.⊣
Corollary 24. Let
$u \in \textbf{V}^{(\mathbb {A})}$
be arbitrarily chosen and the cardinality of
$\mathrm {Part}(\mathrm {dom}_D(u))$
in
$\textbf{V}$
, denoted by
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}}$
, be
$\kappa $
. Then in
$\textbf{V}^{(\mathbb {A})}$
, there exist bijections between u and any
$\kappa $
-like element, but there does not exist any bijection between u and any
$\alpha $
-like element, where
$\alpha < \kappa $
in
$\textbf{V}$
.
A set together with a well-order relation is said to be a well-ordered set. In classical set theory, it is known that every well-ordered set is order isomorphic to an ordinal number. This implies that, a set can be well ordered by a relation if there exists a bijection between the set and an ordinal number. Using this fact, we get the following definition.
Definition 25. Let
$\textbf{V}^{(\mathbb {A})}$
be a
$\mathcal {PS}$
-algebra-valued model. An element
$u \in \textbf{V}^{(\mathbb {A})}$
is called well-ordered
$($
or it can be well-ordered
$)$
if
$\textbf{V}^{(\mathbb {A})} \models \exists x (\mathsf {Ord}(x) \wedge \exists f~\mathrm {BijFunc}(f;u, x))$
holds.
In set theory, the Well-Ordering Theorem states that ‘every set can be well-ordered’. We shall now prove that the validity of the Well-Ordering Theorem in any
$\mathcal {PS}$
-algebra-valued model depends on its validity in the ground model, where the following abbreviation will be used to represent the Well-Ordering Theorem:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqn3.png?pub-status=live)
Theorem 26 (Well-Ordering Theorem in
$\textbf{V}^{(\mathbb {A})}$
)
Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra and
$\textbf{V}$
be a model of
$\mathrm {ZF}$
. If every element of
$\textbf{V}$
can be well-ordered, i.e., for every
$y \in \textbf{V}$
there exists a bijective function between y and an element
$x \in \mathrm {ORD}$
in
$\textbf{V}$
, then any element of
$\textbf{V}^{(\mathbb {A})}$
can also be well-ordered, i.e.,
$\textbf{V}^{(\mathbb {A})} \models \mathrm {WOT}$
.
Proof. Let the Well-Ordering Theorem hold in
$\textbf{V}$
and hence
$\textbf{V} \models \mathrm {AC}$
. Suppose
$u \in \textbf{V}^{(\mathbb {A})}$
is any arbitrary element. Then,
$\mathrm {Part}(\mathrm {dom}_D(u))$
is an element of
$\textbf{V}$
. By our assumption, there exists
$\alpha \in \mathrm {ORD}$
and a bijection between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\alpha $
in
$\textbf{V}$
. Let us now consider any
$\alpha $
-like element v. Then, by using Theorems 13 and 23(iii) we get that
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Ord}(v) \wedge \exists f~\mathrm {BijFunc}(f;u, v))$
. This completes the proof. ⊣
It is also well-known that in classical set theory, the Well-Ordering Theorem is equivalent to the
$\mathsf {Axiom~ of~ Choice}$
. If
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra and
$\textbf{V}$
is a model of
$\mathrm {ZF}$
, then Theorems 22 and 26 are not sufficient to conclude the equivalence of these two statements. However, we have the following conjecture.
Conjecture . The
$\mathsf {Axiom~ of~ Choice}$
and the Well-Ordering Theorem are equivalent in
$\textbf{V}^{(\mathbb {A})}\!:$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu24.png?pub-status=live)
for any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and any model
$\textbf{V}$
of
$\mathrm {ZF}$
.
5.2 Cardinal numbers in
$\mathcal {PS}$
-algebra-valued models
The first-order formula expressing that x is a cardinal number is as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu25.png?pub-status=live)
Definition 27. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
, an element
$u \in \textbf{V}^{(\mathbb {A})}$
is called a cardinal number in
$\textbf{V}^{(\mathbb {A})}$
if
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Card}(u)$
holds.
Using Theorem 13 and Corollary 24 we have the following theorem, which explicitly gives the cardinal numbers in
$\textbf{V}^{(\mathbb {A})}$
.
Theorem 28. For an element
$u \in \textbf{V}^{(\mathbb {A})}$
, a
$\mathcal {PS}$
-algebra-valued model,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Card}(u)$
if and only if u is a
$\kappa $
-like element, where
$\kappa $
is a cardinal number in
$\textbf{V}$
.
The first-order formula which naively expresses that ‘y is the cardinality of x’ is the following:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu26.png?pub-status=live)
Let us arbitrarily fix a
$\mathcal {PS}$
-algebra
$\mathbb {A}$
. For any
$u \in \textbf{V}^{(\mathbb {A})}$
, consider the class
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu27.png?pub-status=live)
By our assumption,
$\textbf{V}$
is a model of
$\mathrm {ZFC}$
. Hence, for any
$u \in \textbf{V}^{(\mathbb {A})}$
,
$\mathsf {Cardinal}_u \neq \varnothing $
, by Theorem 26.
Definition 29. Consider an element
$u \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra. Any element of the class
$\mathsf {Cardinal}_u$
is called a name of the cardinal number of u or simply a cardinal number of u in
$\textbf{V}^{(\mathbb {A})}$
.
For each
$x \in \textbf V$
, let us define an element
$\hat {x}$
of
$\textbf{V}^{(\mathbb {A})}$
recursively as:
$\hat {\varnothing } = \varnothing $
and
$\hat {x} = \{\langle \hat {y}, \textbf {1} \rangle : y \in x\}$
.
Observation 30. For any
$u \in \textbf{V}^{(\mathbb {A})}$
, if
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $
, then using Corollary 24 and Theorem 28 it can be concluded that
$\mathsf {Cardinal}_u$
consists of all
$\kappa $
-like elements. This implies that
$\textbf{V}^{(\mathbb {A})}$
cannot separate the elements in
$\mathsf {Cardinal}_u$
, i.e., for any two cardinal numbers v and w of u,
$\textbf{V}^{(\mathbb {A})} \models v = w$
. In particular, for any
$v \in \mathsf {Cardinal}_u$
,
$\textbf{V}^{(\mathbb {A})} \models v = \hat {\kappa }$
.
Theorem 31. Let
$\mathbb {A}$
be any
$\mathcal {PS}$
-algebra and
$u, v \in \textbf{V}^{(\mathbb {A})}$
be such that
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $
and
$|\mathrm {Part}(\mathrm {dom}_D(v))|_{\textbf{V}} = \eta $
. Then the following are equivalent.
-
(i)
$\textbf{V}^{(\mathbb {A})} \models \exists f ~ \mathrm {BijFunc}(f;u, v)$ .
-
(ii)
$\mathsf {Cardinal}_u = \mathsf {Cardinal}_v$ .
-
(iii)
$\textbf{V}^{(\mathbb {A})} \models \hat {\kappa } = \hat {\eta }$ .
Proof. The proof can be done by using Observation 30 and the fact that, for any
$u, v, w \in \textbf{V}^{(\mathbb {A})}$
, if both
$\textbf{V}^{(\mathbb {A})} \models \exists f ~ \mathrm {BijFunc}(f;u, v)$
and
$\textbf{V}^{(\mathbb {A})} \models \exists g ~ \mathrm {BijFunc}(g;v, w)$
hold then
$\textbf{V}^{(\mathbb {A})} \models \exists h ~ \mathrm {BijFunc}(h;u, w)$
holds as well.⊣
5.3 Ordering in cardinal numbers
In classical set theory we know that for any two elements
$u, v \in \textbf{V}$
,
$|u|_{\textbf{V}} < |v|_{\textbf{V}}$
if and only if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu28.png?pub-status=live)
We shall use the same ontology to define ordering in cardinal numbers in any
$\mathcal {PS}$
-algebra-valued model.
Definition 32. Let
$\textbf{V}^{(\mathbb {A})}$
be a
$\mathcal {PS}$
-algebra-valued model. For any two elements
$u, v \in \textbf{V}^{(\mathbb {A})}$
a cardinal number of u is said to be less than a cardinal number of v if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu29.png?pub-status=live)
Theorem 33 shows that this definition is unambiguous in the sense that if a cardinal number of u is less than a cardinal number of v then we always get an injective function from any element of
$\mathsf {Cardinal}_u$
into any element of
$\mathsf {Cardinal}_v$
but not the other way around.
Theorem 33. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra, and let u and v be as defined in Theorem 31. Then the following are equivalent.
-
(i) A cardinal number of u is less than a cardinal number of v.
-
(ii) For any
$p \in \mathsf {Cardinal}_u$ and
$q \in \mathsf {Cardinal}_v$ ,
$\textbf{V}^{(\mathbb {A})} \models \exists f ~ \mathrm {InjFunc}(f;p, q)$ but
$\textbf{V}^{(\mathbb {A})} \not \models \exists f ~ \mathrm {InjFunc}(f;q, p)$ .
-
(iii) For any
$p \in \mathsf {Cardinal}_u$ and
$q \in \mathsf {Cardinal}_v$ ,
$\textbf{V}^{(\mathbb {A})} \models p \in q$ .
-
(iv)
$\textbf{V}^{(\mathbb {A})} \models \hat {\kappa } \in \hat {\eta }$ .
Proof. A cardinal number of u is less than a cardinal number of v
$\iff $
for any
$p \in \mathsf {Cardinal}_u$
and
$q \in \mathsf {Cardinal}_v$
there is an injection from
$\mathrm {Part}(\mathrm {dom}_D(p))$
into
$\mathrm {Part}(\mathrm {dom}_D(q))$
but no injection from
$\mathrm {Part}(\mathrm {dom}_D(q))$
into
$\mathrm {Part}(\mathrm {dom}_D(p))$
in
$\textbf{V}$
; this is because, applying Theorem 23, we get bijections between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\mathrm {Part}(\mathrm {dom}_D(p))$
and also between
$\mathrm {Part}(\mathrm {dom}_D(v))$
and
$\mathrm {Part}(\mathrm {dom}_D(q))$
in
$\textbf{V}$
,
$\iff \textbf{V}^{(\mathbb {A})} \models p \in q$
, since, by Observation 30, p is
$\kappa $
-like and q is
$\eta $
-like,
$\iff \textbf{V}^{(\mathbb {A})} \models \hat {\kappa } \in \hat {\eta }$
.⊣
Let us fix a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
. An order relation
$<$
between any two ordinal-like elements u and v in
$\textbf{V}^{(\mathbb {A})}$
is defined as follows:Footnote
4
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu30.png?pub-status=live)
Definition 34. For two elements
$u, v \in \textbf{V}^{(\mathbb {A})}$
, it will be said that the cardinality of u is less than the cardinality of v, denoted by
$|u|_{\textbf{V}^{(\mathbb {A})}} < |v|_{\textbf{V}^{(\mathbb {A})}}$
, if for any
$p \in \mathsf {Cardinal}_u$
and
$q \in \mathsf {Cardinal}_v$
,
$p < q$
holds in
$\textbf{V}^{(\mathbb {A})}$
.
Using Theorem 33, it can be proved that Definition 34 is well defined. It can also be proved by Theorem 33 that, for two elements
$u, v \in \textbf{V}^{(\mathbb {A})}$
, where
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $
and
$|\mathrm {Part}(\mathrm {dom}_D(v))|_{\textbf{V}} = \eta $
,
$|u|_{\textbf{V}^{(\mathbb {A})}} < |v|_{\textbf{V}^{(\mathbb {A})}}$
if and only if
$\hat {\kappa } < \hat {\eta }$
in
$\textbf{V}^{(\mathbb {A})}$
. We shall use the abbreviation
$|u|_{\textbf{V}^{(\mathbb {A})}} \leq |v|_{\textbf{V}^{(\mathbb {A})}}$
if either
$|u|_{\textbf{V}^{(\mathbb {A})}} < |v|_{\textbf{V}^{(\mathbb {A})}}$
or
$\mathsf {Cardinal}_u = \mathsf {Cardinal}_v$
holds in
$\textbf{V}^{(\mathbb {A})}$
.
5.4 Cantor’s theorem and the Schröder–Bernstein theorem
We shall prove that two basic demands on cardinality, Cantor’s theorem and the Schröder–Bernstein theorem, hold in any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
.
Theorem 35 (Schröder–Bernstein theorem)
For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
, if
$u, v \in \textbf{V}^{(\mathbb {A})}$
are such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu31.png?pub-status=live)
holds then
$\textbf{V}^{(\mathbb {A})} \models \exists f ~ \mathrm {BijFunc}(f;u, v)$
also holds.
Proof. As an application of Theorem 23, there exist injections from
$\mathrm {Part}(\mathrm {dom}_D(u))$
into
$\mathrm {Part}(\mathrm {dom}_D(v))$
and from
$\mathrm {Part}(\mathrm {dom}_D(v))$
into
$\mathrm {Part}(\mathrm {dom}_D(u))$
in
$\textbf{V}$
. Then, by the Schröder–Bernstein theorem in
$\textbf{V}$
, there exists a bijection between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\mathrm {Part}(\mathrm {dom}_D(v))$
. Hence, one more application of Theorem 23 completes the proof.⊣
To prove Cantor’s theorem in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
we have to first recognize the names corresponding to the power set of a given set in
$\textbf{V}^{(\mathbb {A})}$
. Since the
$\mathsf {Power \; Set \; Axiom}$
is valid in
$\textbf{V}^{(\mathbb {A})}$
, for any
$x \in \textbf{V}^{(\mathbb {A})}$
there exists
$y \in \textbf{V}^{(\mathbb {A})}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu32.png?pub-status=live)
Let
$\mathrm {Pow}(x,y):= \forall t (t \subseteq x \leftrightarrow t \in y)$
. Then,
$\mathrm {Pow}(x,y)$
is the first-order formula, having two free variables x and y, which naively interprets that ‘y is the power set of x’.
Definition 36. Let
$u \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra, be any arbitrary element. An element
$v \in \textbf{V}^{(\mathbb {A})}$
is called a name of the power set of u or simply a power set of u in
$\textbf{V}^{(\mathbb {A})}$
if
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Pow}(u,v)$
.
It is not hard to check that for any
$u \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra, if v and w are two names of the power sets of u in
$\textbf{V}^{(\mathbb {A})}$
, then v and w are identical in
$\textbf{V}^{(\mathbb {A})}$
. So we have the following theorem.
Theorem 37. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and
$u \in \textbf{V}^{(\mathbb {A})}$
, if two elements
$v, w \in \textbf{V}^{(\mathbb {A})}$
are such that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Pow}(u,v)$
and
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Pow}(u,w)$
both hold, then
$\textbf{V}^{(\mathbb {A})} \models v = w$
.
To distinguish activities in the ground model
$\textbf{V}$
and the model
$\textbf{V}^{(\mathbb {A})}$
, ‘subset in
$\textbf{V}$
’ will be expressed by the symbols
$\subseteq _{\textbf{V}}$
, where it is needed.
Lemma 38. Let
$v \in \textbf{V}^{(\mathbb {A})}$
be a power set of an element
$u \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra. If
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $
then
-
(i)
$\mathrm {dom}_D(v)$ consists of elements
$x_A$ corresponding to each
$A \subseteq _{\textbf{V}} \kappa $ , and
-
(ii) if
$x_A, x_B \in \mathrm {dom}_D(v)$ where
$A, B \subseteq _{\textbf{V}} \kappa $ and
$A \neq B$ in
$\textbf{V}$ , then
.
Proof. It is given that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1186.png?pub-status=live)
. So, both
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1187.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1188.png?pub-status=live)
are in D, i.e.,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu33.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu34.png?pub-status=live)
From the first condition, we get that if for any
$x \in \textbf{V}^{(\mathbb {A})}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1190.png?pub-status=live)
, i.e., for any
$t \in \mathrm {dom}_D(x)$
there exists some
$t' \in \mathrm {dom}_D(u)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1193.png?pub-status=live)
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1194.png?pub-status=live)
as well, i.e., there exists
$x' \in \mathrm {dom}_D(v)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1196.png?pub-status=live)
. From the second condition, it can be said that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu35.png?pub-status=live)
i.e., for any
$x \in \mathrm {dom}_D(v)$
and
$t \in \mathrm {dom}_D(x)$
, there exists some
$t' \in \mathrm {dom}_D(u)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1200.png?pub-status=live)
.
By the given condition,
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $
. Hence, there exists a bijection f between
$\mathrm {Part}(\mathrm {dom}_D(u))$
and
$\kappa $
in
$\textbf{V}$
. Let
$A \subseteq _{\textbf{V}} \kappa $
be arbitrarily chosen. Then consider
$\bigcup ~ f^{-1}(A)$
in
$\textbf{V}$
. Clearly,
$\bigcup ~ f^{-1}(A) \subseteq _{\textbf{V}} \mathrm {dom}_D(u)$
. Construct an element
$x \in \textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}(x) = \bigcup ~ f^{-1}(A)$
and
$\mathrm {ran}(x) = \{\textbf {1}\}$
. Therefore, we have
. Hence, using the first condition, we can say that there exists an element
$x_A \in \mathrm {dom}_D(v)$
such that
.
Now suppose
$x \in \mathrm {dom}_D(v)$
is an arbitrary element. We shall prove that there exists
$A \subseteq _{\textbf{V}} \kappa $
such that
. By the second condition, for any
$t \in \mathrm {dom}_D(x)$
there exists an element
$t' \in \mathrm {dom}_D(u)$
such that
. Now consider the class
$[t']$
in
$\mathrm {Part}(\mathrm {dom}_D(u))$
and the image of it under the bijective function f. Let
. Clearly,
$A \subseteq _{\textbf{V}} \kappa $
. Construct an element
$x_A \in \textbf{V}^{(\mathbb {A})}$
such that
$\mathrm {dom}_D(x_A) = \bigcup ~f^{-1}(A)$
and
$\mathrm {ran}(A) = \{\textbf {1}\}$
. Hence, by the construction we get
.
Let us take
$A, B \subseteq _{\textbf{V}}$
such that
$A \neq B$
. It will be proved that
. Without loss of generality, let there exist
$a \in A$
where
$a \notin B$
. By the construction,
$\mathrm {dom}(x_A) = \bigcup ~ f^{-1}(A)$
and
$\mathrm {dom}(x_B) = \bigcup ~ f^{-1}(B)$
, whereas
$\mathrm {ran}(x_A) = \{\textbf {1}\} = \mathrm {ran}(x_B)$
. So for any
$t \in f^{-1}(a)$
,
$x_A(t) = \textbf {1}$
, whereas by the assumption,
. Hence, we can conclude that
.⊣
Corollary 39. If v is a power set of an element u in
$\textbf{V}^{(\mathbb {A})}$
, where
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $
, then
$|\mathrm {Part}(\mathrm {dom}_D(v))|_{\textbf{V}} = 2^\kappa $
.
If
$u \in \textbf{V}^{(\mathbb {A})}$
and two elements
$v, w \in \textbf{V}^{(\mathbb {A})}$
are such that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Pow}(u, v) \wedge \mathrm {Pow}(u, w)$
then, using Theorem 31 and Corollary 39, we can conclude that
$\textbf{V}^{(\mathbb {A})} \models \exists f ~ \mathrm {BijFunc}(f; v, w)$
.
Applying Theorem 33 and Corollary 39, we get the desired result: Cantor’s theorem in
$\textbf{V}^{(\mathbb {A})}$
.
Theorem 40 (Cantor’s theorem)
Let
$\mathbb {A}$
be any
$\mathcal {PS}$
-algebra and
$u \in \textbf{V}^{(\mathbb {A})}$
be an arbitrary element. If
$v \in \textbf{V}^{(\mathbb {A})}$
is such that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Pow}(u, v)$
holds, then
$|u|_{\textbf{V}^{(\mathbb {A})}} < |v|_{\textbf{V}^{(\mathbb {A})}}$
also holds.
5.5 Generalized continuum hypothesis in
$\mathcal {PS}$
-algebra-valued models
We shall prove in this section that the necessary and sufficient condition of the validity of the generalized continuum hypothesis (
$\mathrm {GCH}$
) in any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
is its validity in the ground model
$\textbf{V}$
. Hence,
$\mathrm {GCH}$
becomes independent of the set theory corresponding to
$\textbf{V}^{(\mathbb {A})}$
. The statement of
$\mathrm {GCH}$
is as follows.
For any infinite set s there does not exist any set t such that the cardinal number of s is less than the cardinal number of t and the cardinal number of t is less than the cardinal number of the power set of s.
Definition 41. In any
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, an element
$u \in \textbf{V}^{(\mathbb {A})}$
is said to be infinite if for any natural-number-like element
$\hat {n}$
, where
$n \in \mathrm {ORD}$
is a natural number, there exists a subset v of u in
$\textbf{V}^{(\mathbb {A})}$
such that
$\hat {n}$
is a cardinal number of v, i.e.,
$\hat {n} \in \mathsf {Cardinal}_v$
.
Theorem 42. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and a model
$\textbf{V}$
of
$\mathrm {ZFC}$
,
$\textbf{V} \models \mathrm {GCH}$
if and only if
$\textbf{V}^{(\mathbb {A})} \models \mathrm {GCH}$
.
Proof. Let
$\textbf{V} \models \mathrm {GCH}$
; we shall prove that
$\textbf{V}^{(\mathbb {A})} \models \mathrm {GCH}$
. Suppose
$u \in \textbf{V}^{(\mathbb {A})}$
is an infinite element and
$\hat {\kappa } \in \mathsf {Cardinal}_u$
. By this assumption we get that for any natural number in
$\mathrm {ORD}$
there exists a subset of
$\kappa $
which has the cardinality of that natural number in
$\textbf{V}$
. Hence,
$\kappa $
is an infinite cardinal in
$\textbf{V}$
. Let v be a power set of u in
$\textbf{V}^{(\mathbb {A})}$
. Then, by using Corollary 39, we get that
$\hat {(2^\kappa )} \in \mathsf {Cardinal}_v$
. If possible, let there exist
$w \in \textbf{V}^{(\mathbb {A})}$
such that
$|u|_{\textbf{V}^{(\mathbb {A})}} < |w|_{\textbf{V}^{(\mathbb {A})}} < |v|_{\textbf{V}^{(\mathbb {A})}}$
. Let
$\hat {\eta } \in \mathsf {Cardinal}_w$
. Hence, by Theorem 23, we get
$\kappa < \eta < 2^\kappa $
in
$\textbf{V}$
, which contradicts our assumption that
$\textbf{V} \models \mathrm {GCH}$
.
Conversely, suppose
$\textbf{V} \nvDash \mathrm {GCH}$
. Then in
$\textbf{V}$
, there are infinite cardinals
$\kappa $
and
$\eta $
such that
$\kappa < \eta < 2^\kappa $
. Now consider the element
$\hat {\kappa } \in \textbf{V}^{(\mathbb {A})}$
. Clearly, by definition,
$\hat {\kappa }$
is an infinite cardinal number in
$\textbf{V}^{(\mathbb {A})}$
as well. Let v be a power set of
$\hat {\kappa }$
in
$\textbf{V}^{(\mathbb {A})}$
. Again by using Corollary 39, it can be concluded that (
$\hat {2^\kappa }$
)
$\in \mathsf {Cardinal}_v$
. Hence, by our assumption,
$|\hat {\kappa }|_{\textbf{V}^{(\mathbb {A})}} < |\hat {\eta }|_{\textbf{V}^{(\mathbb {A})}} < |v|_{\textbf{V}^{(\mathbb {A})}}$
, i.e.,
$\textbf{V}^{(\mathbb {A})} \nvDash \mathrm {GCH}$
.⊣
Let us consider any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and two models
$\textbf{V}_1$
and
$\textbf{V}_2$
of
$\mathrm {ZFC}$
such that
$\textbf{V}_1 \models \mathrm {GCH}$
but
$\textbf{V}_2 \not \models \mathrm {GCH}$
. Then, as an application of Theorem 42,
$\textbf{V}_1^{(\mathbb {A})} \models \mathrm {GCH}$
whereas
$\textbf{V}_2^{(\mathbb {A})} \not \models \mathrm {GCH}$
. Let
$\mathsf {T}$
be the theory consisting of the set-theoretic sentences, in the language of
$\mathrm {ZFC}$
, which are valid in both of
$\textbf{V}_1^{(\mathbb {A})}$
and
$\textbf{V}_2^{(\mathbb {A})}$
. By Observation 7,
$\mathrm {NFF}$
-
$\mathrm {ZF} \subseteq \mathsf {T}$
, as both of
$\textbf{V}_1^{(\mathbb {A})}$
and
$\textbf{V}_2^{(\mathbb {A})}$
validate
$\mathrm {NFF}$
-
$\mathrm {ZF}$
. Since the theory
$\mathsf {T}$
has two models, viz.
$\textbf{V}_1^{(\mathbb {A})}$
and
$\textbf{V}_2^{(\mathbb {A})}$
, which disagree with respect to the validity of
$\mathrm {GCH}$
,
$\mathrm {GCH}$
is independent from the theory
$\mathsf {T}$
. Depending on the choice of the
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and the designated set of it, the theory
$\mathsf {T}$
could be a non-classical set theory. This fact leads us to a study of independence proofs in non-classical set theories [Reference Tarafder and Venturi13].
6 Cardinal arithmetic in
$\mathcal {PS}$
-algebra-valued models
In this section we define
$\kappa + \eta $
,
$\kappa ~.~ \eta $
, and
$\kappa ^\eta $
in
$\textbf{V}^{(\mathbb {A})}$
for any two cardinal numbers
$\kappa , \eta \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is any
$\mathcal {PS}$
-algebra and
$\textbf{V}$
is a model of
$\mathrm {ZFC}$
. Like the other constructions, these operations are defined in
$\textbf{V}^{(\mathbb {A})}$
to be similar to their notions in classical set theory.
In classical set theory, for any two cardinal numbers
$\kappa $
and
$\eta $
, cardinal addition
$\kappa + \eta $
is defined as the cardinal number of the set
$(\kappa \times \{0\}) \cup (\eta \times \{1\})$
, and cardinal multiplication
$\kappa ~.~ \eta $
is defined to be the cardinal number of the set
$\kappa \times \eta $
. For any two sets x and y in
$\textbf{V}$
, the set
$x^y$
is defined as the collection of all functions from y into x. This is then used to define cardinal exponentiation in
$\textbf{V}$
as
$|x|^{|y|} = |x^y|$
.
To define these operations in
$\textbf{V}^{(\mathbb {A})}$
, we recall Definition 21 of pair-like elements. Then we get the following proposition.
Proposition 43. Let
$\mathbb {A}$
be any
$\mathcal {PS}$
-algebra and
$u, v \in \textbf{V}^{(\mathbb {A})}$
be two elements such that u is
$(a, b)$
-like and v is
$(c, d)$
-like, for some
$a, b, c, d \in \textbf{V}^{(\mathbb {A})}$
. Then
if and only if
and
.
Let us now define the cross product in
$\textbf{V}^{(\mathbb {A})}$
as follows.
Definition 44. Let
$u, v \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra, be any two arbitrary elements. An element
$w \in \textbf{V}^{(\mathbb {A})}$
is said to be
$(u \times v)$
-like if for each
$a \in \mathrm {dom}_D(u)$
and
$b \in \mathrm {dom}_D(v)$
there exists an
$(a, b)$
-like element in
$\mathrm {dom}(w)$
and nothing else
$;$
whereas
$\mathrm {ran}(w) = \{\textbf {1}\}$
.
For any two
$(u \times v)$
-like elements p and q,
$|\mathrm {Part}(\mathrm {dom}_D(p))|_{\textbf{V}} = |\mathrm {Part}(\mathrm {dom}_D(q))|_{\textbf{V}}$
, using Proposition 43. Hence, by applying Theorems 23 and 31 we get
$\mathsf {Cardinal}_p = \mathsf {Cardinal}_q$
. We are now able to define cardinal addition, cardinal multiplication, and cardinal exponentiation in
$\textbf{V}^{(\mathbb {A})}$
.
6.1 Cardinal addition
We define addition of two cardinal numbers in a
$\mathcal {PS}$
-algebra-valued model as it is defined in classical set theory.
Definition 45. Let u and v be two cardinal numbers in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
. Suppose
$p, q \in \textbf{V}^{(\mathbb {A})}$
are two elements such that
$\mathrm {dom}(p) = \{\hat {1}\}$
,
$\mathrm {dom}(q) = \{\hat {0}\}$
, and
$\mathrm {ran}(p) = \{\textbf {1}\} = \mathrm {ran}(q)$
. Let s be a
$(u \times p)$
-like element and t be a
$(v \times q)$
-like element. If
$|\mathrm {Part}(\mathrm {dom}_D(s \cup t))|_{\textbf{V}} = \xi $
, then the addition of u and v, denoted by
$u + v$
, is the cardinal number
$\hat {\xi }$
.
Theorem 46 shows that the definition of cardinal addition in a
$\mathcal {PS}$
-algebra-valued model is well defined.
Theorem 46. Let u and v be two cardinal numbers in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, where u is
$\kappa $
-like and v is
$\eta $
-like, where
$\kappa ~. ~ \eta = \zeta $
and
$\kappa + \eta = \xi $
(say) in
$\textbf{V}$
. Then the following hold.
-
(i) For any
$(u \times v)$ -like element
$w \in \textbf{V}^{(\mathbb {A})}$ ,
$|\mathrm {Part}(\mathrm {dom}_D(w))|_{\textbf{V}} = \zeta $ .
-
(ii) Suppose
$p, q \in \textbf{V}^{(\mathbb {A})}$ are such that
$\mathrm {dom}(p) = \{\hat {1}\}$ ,
$\mathrm {dom}(q) = \{\hat {0}\}$ , and
$\mathrm {ran}(p) = \{\textbf {1}\} = \mathrm {ran}(q)$ . Then for any
$(u \times p)$ -like element s and
$(v \times q)$ -like element t,
$|\mathrm {Part}(\mathrm {dom}_D(s \cup t))|_{\textbf{V}} = \xi $ .
Corollary 47. For any two cardinal numbers u and v in
$\textbf{V}^{(\mathbb {A})}$
, where u is
$\kappa $
-like and v is
$\eta $
-like, if
$\kappa + \eta = \xi $
in
$\textbf{V}$
then
$u + v$
is
$\hat {\xi }$
in
$\textbf{V}^{(\mathbb {A})}$
.
Once we have Corollary 47, we can prove the following theorem, which gives us some basic properties of cardinal addition.
Theorem 48. For any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and any cardinal numbers
$u, v, w \in \textbf{V}^{(\mathbb {A})}$
, the following are valid in
$\textbf{V}^{(\mathbb {A})}$
.
-
(i)
$u + \mathsf {zero} = \hat {\kappa }$ , where
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $ and
$\mathsf {zero}$ is any 0-like element.
-
(ii)
$(u + v) + w = u + (v + w)$ .
-
(iii)
$u + v = v + w$ .
-
(iv) If
$u \leq v$ then
$u + w \leq v + w$ .
By the definition, we know that for any two cardinal numbers
$u, v \in \textbf{V}^{(\mathbb {A})}$
, one of
$u \leq v$
and
$v < u$
is valid. We say
$\mathrm {max}\{u, v\} = v$
if and only if
$u \leq v$
in
$\textbf{V}^{(\mathbb {A})}$
.
Theorem 49. Let u and v be two cardinal numbers in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, where at least one of them is infinite. Then
$u + v = \mathrm {max}\{u, v\}$
is valid in
$\textbf{V}^{(\mathbb {A})}$
.
Proof. Using Observation 30, we know that all cardinal numbers are cardinal-like elements. Hence, the proof follows from the fact that the theorem holds in the ground model
$\textbf{V}$
of
$\mathrm {ZFC}$
.⊣
6.2 Cardinal multiplication
As for cardinal addition, we shall define cardinal multiplication in a
$\mathcal {PS}$
-algebra-valued model as it is defined in classical set theory.
Definition 50. Let u and v be two cardinal numbers in
$\textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra. Suppose
$w \in \textbf{V}^{(\mathbb {A})}$
is a
$(u \times v)$
-like element. If
$|\mathrm {Part}(\mathrm {dom}_D(w))|_{\textbf{V}} = \kappa $
then the cardinal multiplication of u and v in
$\textbf{V}^{(\mathbb {A})}$
, denoted by
$u ~.~ v$
, is defined to be the cardinal number
$\hat {\kappa }$
.
The definition of cardinal multiplication in
$\mathcal {PS}$
-algebra-valued models is well defined by Theorem 46(i). Moreover, if u and v are, respectively,
$\kappa $
-like and
$\eta $
-like elements, where
$\kappa ~. ~ \eta = \xi $
(say) in
$\textbf{V}$
, then
$u~. ~ v$
is
$\hat {\xi }$
in
$\textbf{V}^{(\mathbb {A})}$
. Hence, we have the following theorem.
Theorem 51. For any cardinal numbers
$u, v, w \in \textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra, the following are valid in
$\textbf{V}^{(\mathbb {A})}$
.
-
(i)
$u ~.~ \mathsf {zero} = \hat {0}$ , where
$\mathsf {zero}$ is any 0-like element.
-
(ii)
$u~ .~ \mathsf {one} = \hat {\kappa }$ , where
$|\mathrm {Part}(\mathrm {dom}_D(u))|_{\textbf{V}} = \kappa $ and
$\mathsf {one}$ is any 1-like element.
-
(iii)
$(u ~.~ v) ~.~ w = u~ .~ (v~. ~w)$ .
-
(iv)
$u~ .~ v = v~ .~ u$ .
-
(v) If
$u \leq v$ then
$u~ .~ w \leq v~ .~ w$ .
-
(vi)
$u~ .~ (v + w) = u~ .~ v + u~ .~ w$ .
Following the proof of Theorem 49, we can also derive the following theorem.
Theorem 52. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra and
$u, v \in \textbf{V}^{(\mathbb {A})}$
be two cardinal numbers such that at least one of them is infinite and the other one is not
$0$
-like. Then
$u~ .~ v = \mathrm {max}\{u, v\}$
is valid in
$\textbf{V}^{(\mathbb {A})}$
.
6.3 Cardinal exponentiation
We shall first discuss the exponentiation of two elements in
$\textbf{V}^{(\mathbb {A})}$
. Cardinal exponentiation will follow from it.
Definition 53. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
algebra and
$u, v \in \textbf{V}^{(\mathbb {A})}$
be two arbitrary elements. Then an element
$w \in \textbf{V}^{(\mathbb {A})}$
is called a
$v^u$
-like element if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu36.png?pub-status=live)
and
$\mathrm {ran}(w) = \{\textbf {1}\}$
.
Definition 54. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra. Let
$u, v \in \textbf{V}^{(\mathbb {A})}$
be two cardinal numbers, and let
$w \in \textbf{V}^{(\mathbb {A})}$
be a
$v^u$
-like element. If
$|\mathrm {Part}(\mathrm {dom}_D(w))|_{\textbf{V}} = \xi $
then the cardinal number v to the power u, denoted by
$v^u$
, is defined to be the cardinal number
$\hat {\xi }$
in
$\textbf{V}^{(\mathbb {A})}$
.
This definition is proved to be well defined by Theorem 56.
Lemma 55. Let
$\mathbb {A}$
be a
$\mathcal {PS}$
-algebra. Let
$u, v \in \textbf{V}^{(\mathbb {A})}$
be any two arbitrary elements, and let
$w \in \textbf{V}^{(\mathbb {A})}$
be a
$v^u$
-like element. Then there exists a bijection between
$\mathrm {Part}(\mathrm {dom}_D(w))$
and
$\mathrm {Part}(\mathrm {dom}_D(v))^{\mathrm {Part}(\mathrm {dom}_D(u))}$
in
$\textbf{V}$
.
Proof. For any
$f \in \mathrm {dom}_D(w)$
we get
$\textbf{V}^{(\mathbb {A})} \models \mathrm {Func}(f) \wedge \mathrm {Dom}(f;u) \wedge \mathrm {Codom}(f;v)$
, by definition. Hence, all of (i)–(v) in the proof of Theorem 23 hold for every
$f \in \mathrm {dom}_D(w)$
. Applying Proposition 43, the lemma is proved.⊣
Theorem 56. Let u and v be two cardinal numbers in a
$\mathcal {PS}$
-algebra-valued model
$\textbf{V}^{(\mathbb {A})}$
, where u is
$\eta $
-like and v is
$\kappa $
-like. If
$\kappa ^\eta = \xi $
in
$\textbf{V}$
, then for any
$v^u$
-like element
$w \in \textbf{V}^{(\mathbb {A})}$
,
$|\mathrm {Part}(\mathrm {dom}_D(w)|_{\textbf{V}} = \xi $
.
Proof. There exists a bijection between
$\mathrm {Part}(\mathrm {dom}_D(w))$
and
$\mathrm {Part}(\mathrm {dom}_D (v))^{\mathrm {Part}(\mathrm {dom}_D(u))}$
in
$\textbf{V}$
, by Lemma 55. Hence,
$|\mathrm {Part}(\mathrm {dom}_D(w))|_{\textbf{V}} = \kappa ^\eta = \xi $
.⊣
Using Theorem 56, we get the following theorem.
Theorem 57. If
$u, v, w$
are three cardinal numbers in
$\textbf{V}^{(\mathbb {A})}$
, where
$\mathbb {A}$
is a
$\mathcal {PS}$
-algebra, then the following are valid in
$\textbf{V}^{(\mathbb {A})}$
.
-
(i)
$u^{\mathsf {zero}} = \hat {1};~ \mathsf {one}^{u} = \hat {1};~ \mathsf {zero}^{u} = \hat {0}$ if
$\hat {0} < |u|_{\textbf{V}^{(\mathbb {A})}}$ , where
$\mathsf {zero}$ and
$\mathsf {one}$ are any 0-like element and 1-like element, respectively.
-
(ii)
$(u~ .~ v)^w = u^w~ .~ v^w$ .
-
(iii)
$u^{v + w} = u^v ~.~ u^w$ .
-
(iv)
$(u^v)^w = u^{v~.~w}$ .
-
(v) If
$u \leq v$ then
$u^w \leq v^w$ .
-
(vi) If
$\hat {0} < u \leq v$ then
$w^u \leq w^v$ .
7 Conclusion
7.1 Comparison between
$\mathcal {PS}$
-algebra-valued set theories and
$\mathsf {IZF}$
It is discussed that there are
$\mathcal {PS}$
-algebras
$\mathbb {A}$
and designated sets D such that the logic of
$(\mathbb {A}, D)$
is classical and the corresponding algebra-valued models are the models of classical set theory. The
$\mathcal {PS}$
-algebra-valued models of non-classical set theories are quite different from the well-known non-classical set theory
$\mathsf {IZF}$
when it comes to the foundation of mathematics. We can enlist the following evidences in support of this claim.
(i) An ordinal in
$\mathsf {IZF}$
is defined to be a transitive set of transitive sets, where a set x is said to be transitive if for any element
$y \in x$
,
$y \subseteq x$
holds. Notice that, unlike classical set theory, the definition of ordinal number in
$\mathsf {IZF}$
does not demand the linearity of the set with respect to
$\in $
. An ordinal
$\alpha $
is said to be linear if for any pair of ordinals
$\beta , \gamma \in \alpha $
,
$(\beta \in \gamma ) \vee (\beta = \gamma ) \vee (\gamma \in \beta )$
is satisfied. It can be proved that,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu37.png?pub-status=live)
which can be derived from the fact that
$\mathsf {IZF} + \mbox { `Every ordinal is linear'} \vdash \varphi \vee \neg \varphi $
, for any
$\varphi \in \mathsf {Prop}$
(cf. [Reference Bell2, p. 164]). On the contrary, Theorem 13 shows that for any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
and any ordinal-like element
$u \in \textbf{V}^{(\mathbb {A})}$
,
$\textbf{V}^{(\mathbb {A})} \models \mathsf {Ord}(u)$
and hence,
$\textbf{V}^{(\mathbb {A})} \models \mathrm {LO}(u)$
. Intuitively, this leads to the conclusion that in any
$\mathcal {PS}$
-algebra-valued model, every ordinal is linear, which is not the case in
$\mathsf {IZF}$
. In connection with that, we also have the following point.
(ii) Consider the first-order formula:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu38.png?pub-status=live)
The naive interpretation of
$\varphi $
is that ‘the subsets of 1 are either 0 or 1’. One can prove that
$\varphi $
is not a theorem of
$\mathsf {IZF}$
. To check this, let us consider the three-valued Heyting algebra
. The designated set is considered to be
$D = \{\textbf {1}\}$
. We can then prove that
and hence conclude that
$\textbf{V}^{(\mathbb {H})} \not \models \varphi $
. On the other hand, it can be proved that for any
$\mathcal {PS}$
-algebra
$\mathbb {A}$
,
$\textbf{V}^{(\mathbb {A})} \models \varphi $
. Furthermore, we have proved in Section 5.4 that in any
$\mathcal {PS}$
-algebra-valued models, the cardinal numbers of all the names representing the power set of a
$\kappa $
-like element, where
$\kappa \in \mathrm {ORD}$
, are exactly the
$2^\kappa $
-like elements.
(iii) It can be proved that for any Heyting algebra
$\mathbb {H}$
,
$\textbf{V}^{(\mathbb {H})} \models \mathrm {AC}$
if and only if
$\mathbb {H}$
is a Boolean algebra [Reference Bell2, p. 166]. On the other hand, Theorem 22 shows that any
$\mathcal {PS}$
-algebra-valued model validates
$\mathrm {AC}$
if the ground model validate
$\mathrm {AC}$
.
7.2 Comparison between
$\mathcal {PS}$
-algebra-valued set theories and an established paraconsistent set theory
In 2012, Weber studied cardinal numbers in a paraconsistent set theory [Reference Weber14]. In his construction, the general comprehension axiom is taken as one of the axioms, viz.
$\mathsf {Abstraction}$
. As a result, this theory admits Russell’s set, the collection of all sets, the collection of all ordinals, etc. into the universe of sets, unlike classical set theory. In [Reference Tarafder, Banerjee and Krishna11], we find a study of ordinal numbers in an algebra-valued model of a paraconsistent set theory, viz. the set theory of
$\textbf{V}^{(\mathrm {PS}_3)}$
. It was proved that the model
$\textbf{V}^{(\mathrm {PS}_3)}$
of a certain paraconsistent set theory, which was developed in [Reference Löwe and Tarafder9, Reference Tarafder, Banerjee and Krishna11], agrees with classical set theory on the invalidity of the general comprehension axiom. As a result, Russell’s set, the collection of all sets, and the collection of all ordinals are not sets in this model. Since
$\mathrm {PS}_3$
is a particular
$\mathcal {PS}$
-algebra, we can easily extend these results to all
$\mathcal {PS}$
-algebras following the same proofs done in [Reference Löwe and Tarafder9, Reference Tarafder, Banerjee and Krishna11].
On the other hand, the presence of the general comprehension axiom ensures that the
$\mathsf {Separation~ Axiom~ Schema}$
is valid in Weber’s set theory, whereas it can be proved that there are instances of the later which are not valid in some
$\mathcal {PS}$
-algebra-valued models. Since all the
$\mathcal {PS}$
-algebras are deductive reasonable implication algebras, as an application of Theorem 1, it is well understood that those instances of the
$\mathsf {Separation~ Axiom~ Schema}$
are not negation-free formulas.
Definition 58. A
$\mathcal {PS}$
-algebra
$\mathbb {A} = \langle \textbf {A}, \wedge , \vee , \Rightarrow , ^*, \textbf {1}, \textbf {0} \rangle $
is said to be a paraconsistent
$\mathcal {PS}$
-algebra if there exists
$a \in \textbf {A} \setminus \{\textbf {0}\}$
such that
$a^* \neq \textbf {0}$
as well.
Observe that, independent of the designated set D, the logic of any paraconsistent
$\mathcal {PS}$
-algebra
$\mathbb {A}$
will be a paraconsistent logic. Consider a valuation function v and two propositional formulas
$\varphi $
and
$\psi $
such that
$v(\varphi ) = a$
and
$v(\psi ) = \textbf {0}$
. Then
$v((\varphi \wedge \neg \varphi ) \to \psi ) = \textbf {0}$
, which implies that
$(\varphi \wedge \neg \varphi ) \to \psi \notin \textbf {L}(\mathbb {A}, D)$
.
Theorem 59. Let
$\mathbb {A}$
be a paraconsistent
$\mathcal {PS}$
-algebra. Then there is a formula
$\varphi (x)$
having one free variable x, in the language of
$\mathrm {ZFC}$
, for which the corresponding instance of the
$\mathsf {Separation~ Axiom~ Schema}$
fails in
$\textbf{V}^{(\mathbb {A})}$
, irrespective of the choice of any designated set.
Proof. Let D be any designated set in
$\mathbb {A}$
. Since
$\mathbb {A}$
is a paraconsistent
$\mathcal {PS}$
-algebra, there exists an element
$a \in \textbf {A}$
such that
$a, a^* \neq \textbf {0}$
. Consider the two elements of
$\textbf{V}^{(\mathbb {A})}$
:
$u=\{\langle \varnothing , \textbf {1} \rangle \}$
and
$v=\{\langle \varnothing , a \rangle \}$
. Then,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu39.png?pub-status=live)
Let us now consider the formula
$\varphi (x) := \neg \exists y (y \in x)$
. Then,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu40.png?pub-status=live)
Similarly, since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1621.png?pub-status=live)
we calculate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1622.png?pub-status=live)
. We go on to show that the instance of the
$\mathsf {Separation~ Axiom~ Schema}$
corresponding to the formula
$\varphi $
fails. Fix the element w of
$\textbf{V}^{(\mathbb {A})}$
, where
$w= \{\langle u,\textbf {1} \rangle , \langle v, \textbf {1} \rangle \}$
. We show that ‘there does not exist any subset of w in
$\textbf{V}^{(\mathbb {A})}$
consisting of those elements which satisfy the formula
$\varphi (x)$
’. Formally, we shall show that,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu41.png?pub-status=live)
Suppose that, for an arbitrary
$y_0 \in \textbf{V}^{(\mathbb {A})}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu42.png?pub-status=live)
Then, in particular,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1630.png?pub-status=live)
. Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1631.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1632.png?pub-status=live)
, by our assumption
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1633.png?pub-status=live)
. Hence, there exists a
$z_0 \in \mathrm {dom}(y_0)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1635.png?pub-status=live)
. So we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1636.png?pub-status=live)
and thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1637.png?pub-status=live)
. This implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1638.png?pub-status=live)
. But then, since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_inline1639.png?pub-status=live)
we have:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu43.png?pub-status=live)
Thus,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu44.png?pub-status=live)
Since
$y_0$
is arbitrarily chosen from
$\textbf{V}^{(\mathbb {A})}$
, we finally have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu45.png?pub-status=live)
This completes the proof.⊣
7.3 Comparison between
$\mathcal {PS}$
-algebra-valued set theories and the classical set theory
The motivation for building
$\mathcal {PS}$
-algebra-valued models
$\textbf{V}^{(\mathbb {A})}$
is not only to provide models of a class of different non-classical set theories but also to investigate the existence of non-classical mathematical realms which do not differ from classical mathematics with respect to the basic mathematical demands. This makes
$\textbf{V}^{(\mathbb {A})}$
quite different from the other non-classical set theories that already exist in the literature. However, the formation of ordinals in the Boolean-valued models are quite different from the ordinal-like elements. To explain this formally, we shall explore the ordinal numbers in a given Boolean-valued model. Let
$\mathbb {B}$
be a complete Boolean algebra having the underlying set
$\textbf {B}$
. The mixture of a set
$\{u_i \in \textbf{V}^{(\mathbb {B})}~:~ i \in \Lambda \}$
with respect to a set
$\{b_i \in \textbf {B}~:~ i \in \Lambda \}$
is defined by an element
$u \in \textbf{V}^{(\mathbb {B})}$
where
$\mathrm {dom}(u) = \bigcup \limits _{i \in \Lambda }\mathrm {dom}(u_i)$
and for
$x \in \mathrm {dom}(u)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220406134132212-0700:S0022481221001018:S0022481221001018_eqnu46.png?pub-status=live)
A subset
$A \subseteq \textbf {B}$
is called an antichain in
$\textbf {B}$
if for any two elements
$a, b \in A$
,
$a \wedge b = \textbf {0}$
. An antichain A in
$\textbf {B}$
is said to be a partition of unity in
$\textbf {B}$
if
$\bigvee A = \textbf {1}$
. The elements
$\hat {\alpha }$
of
$\textbf{V}^{(\mathbb {B})}$
, for all ordinals
$\alpha \in \textbf{V}$
, are said to be the standard ordinals of
$\textbf{V}^{(\mathbb {B})}$
. Then, the ordinals in
$\textbf{V}^{(\mathbb {B})}$
are characterised by the mixtures of standard ordinals with respect to the partitions of unity [Reference Bell2, p. 47]. This shows that, depending on the Boolean algebra
$\mathbb {B}$
, the class of ordinals in
$\textbf{V}^{(\mathbb {B})}$
does not only contain the standard ordinals. Moreover, there exist ordinals
$u \in \textbf{V}^{(\mathbb {B})}$
such that
$\{\textbf {1}\} \subsetneqq \mathrm {ran}(u)$
. But, for any ordinal-like element u in
$\textbf{V}^{(\mathbb {B})}$
,
$\mathrm {ran}(u) = \{\textbf {1}\}$
, since the designated set is always considered to be
$\{\textbf {1}\}$
in a Boolean-valued model of classical set theory. Hence, there are complete Boolean algebras
$\mathbb {B}$
so that the class of ordinals and the class of ordinal-like elements in the corresponding Boolean-valued model
$\textbf{V}^{(\mathbb {B})}$
are different. This is not the case if we consider the two-valued Boolean-algebra.
All the
$\mathcal {PS}$
-algebra-valued models are expressive enough to have the properties of the natural numbers, the cardinal numbers, and cardinal arithmetic, which are similar to those in classical set theory, as shown in Sections 4–6. Depending on that, the advancement of different branches of mathematics in
$\mathcal {PS}$
-algebra-valued models
$\textbf{V}^{(\mathbb {A})}$
will be continued in future.
In addition, Theorems 22 and 42 give an indication that, as in classical set theory, one can also come up with independent set-theoretic statements in non-classical set theories, through the construction of algebra-valued models. This might lead us to the study of forcing in non-classical set theories in the light of [Reference Tarafder and Venturi13].
Acknowledgments
I want to acknowledge FAPESP for providing me with a Visiting Researcher grant having number Processo n. 2016/25891-3 in the University of Campinas, Brazil for 1 year; part of this research work was done during this period. I also thank Prof. Benedikt Löwe for his valuable comments.