Two variants of noncontingency operator
Jie Fan
School of Humanities, University of Chinese Academy of Sciences, Beijing, China
[email protected]
Abstract
By slightly adapting two equivalent semantics of noncontingency operator, we obtain two variants, ⊡ and ⊞, with non-equivalent semantics. We show that on the class of models satisfying any of five basic properties (i.e. seriality, reflexivity, transitivity, symmetry, Euclidicity), the logic L(⊡), which has ⊡ as the sole modal primitive, is less expressive than the logic L(⊞), which has ⊞ as the sole modal primitive. We investigate the frame definability of both languages. We then axiomatize L(⊞) and L(⊡) over various classes of bimodal frames. Among other results, a notion of morphisms, called ‘⊡-morphisms’, are provided to show the completeness of axiomatizations of L(⊡) over serial frames and also over symmetric frames.
1 Introduction
Past decades have witnessed a bunch of studies on noncontingency logic, see e.g. [Hum95, Kuh95, Zol99, vdHL04, Ste08, FWvD14, FvD15, FWvD15, Fan18a, Fan18b, Fan19]. This logic is obtained by enriching propositional logic with an important metaphysical notion — contingency, which dates back to Aristotle [Bro67]. Intuitively, a proposition is contingent, if it is possibly true and also possibly false; otherwise, it is noncontingent, i.e. necessarily true or necessarily false. In an epistemic setting, contingency amounts to ‘ignorance’, and noncontingency amounts to ‘knowing whether’, which is perhaps the closest knowing-wh companion to ‘knowing that’ (namely, standard propositional knowledge) among various knowledge types [Wan16].
Formally, given a Kripke model M=⟨S,R,V⟩, where S is a nonempty set of possible worlds, R⊆S×S is called accessibility relation, and V is a valuation that assigns a set V(p)⊆S to each propositional variable p, the formula Δφ, read “it is noncontingent that φ”, is evaluated as follows:
[TABLE]
Equivalently,
[TABLE]
where R(s)⊨φ means that φ is true at all successors of s w.r.t. R, and similarly for R(s)⊨¬φ.
By slightly adapting the above semantics, we obtain two variants of Δ, denoted ⊡ and ⊞ respectively, as follows.
[TABLE]
It is not hard to see that (DEF 1) and (DEF 2) are, respectively, special cases of (DEF 1’) and (DEF 2’) when R1=R2=R. This entails that both ⊡ and ⊞ are more general than Δ. Moreover, as ⊨⊡φ↔⊡¬φ but ⊭⊞φ↔⊞¬φ (as we will see below), we may call ⊡ ‘general noncontingency’ and ⊞ ‘pseudo noncontingency’ operators. Unlike the fact that (DEF 1) is equivalent to (DEF 2), (DEF 1’) and (DEF 2’) are not equivalent, that is, ⊭⊡φ↔⊞φ.
This paper investigates both operators. Roughly speaking, a proposition is generalized noncontingent, if the proposition has the same truth value no matter whether you look at it in this way (R1) or in that way (R2); and a proposition is pseudo noncontingent, if it is necessary in this way (R1), or it is impossible in that way (R2). Whenever both ways are the same, both operators then become the more-familiar noncontingency operator.
The remainder of the paper is structured as follows. After introducing the syntax and semantics of logic L(⊡) for generalized noncontingency and logic L(⊞) for pseudo noncontingency (Sec. 2), we compare the relative expressivity of the two logics (Sec. 3), and investigate their frame definability (Sec. 5) with the help of a notion of ⊡-morphisms (Sec. 4). We then axiomatize L(⊞) and L(⊡) over various bimodal frames in Sec. 6 and Sec. 7, where the completeness of L(⊡) over serial frames and also over symmetric frames are proved via the notion of ⊡-morphisms. We conclude with a few future work in Sec. 8.
2 Syntax and semantics
Let P be a fixed nonempty set of propositional variables.
Definition 1** (Syntax).**
Where p∈P, the language L(⊡) of generalized noncontingency logic and the language L(⊞) of pseudo noncontingency logic are defined inductively as follows.
[TABLE]
⊡φ and ⊞φ are read “it is generalized noncontingent that φ” and “it is pseudo noncontingent that φ”, respectively. As we will see below, the comparisons between the two languages are interesting, both in expressivity and in axiomatizations.
The languages are interpreted on bimodal models. To say that M=⟨S,R1,R2,V⟩ is a bimodal model, if S is a nonempty set of possible worlds, R1 and R2 are accessibility relations over S, and V is a function assigning to each propositional variable a subset of S. A bimodal frame F is a bimodal model without valuations. If R1 and R2 both possess a property P (such as seriality, reflexivity, transitivity, symmetry, Euclidicity), then M (F) is called a P bimodal model (resp. a P bimodal frame). Moreover, Ri(s)={t∈S∣sRit} for i=1,2.
Definition 2** (Semantics).**
Given a bimodal model M=⟨S,R1,R2,V⟩ and s∈S, the semantics of both languages is defined as follows.
[TABLE]
Where for i∈{1,2}, Ri(s)⊨φ stands for “for all t∈Ri(s),M,t⊨φ”, and Ri(s)⊭φ for the negation of this claim, that is, “for some t∈Ri(s), M,t⊭φ”. Obviously, when R1(s)=∅ or R2(s)=∅, it holds vacuously that M,s⊨⊞φ and M,s⊨⊡φ for all φ; if R1=R2, then ⊞=⊡ and each of them becomes an operator for noncontingency.
It is noteworthy remarking that ⊨⊡φ↔(⊞φ∧⊞¬φ), as can be seen more clearly from an alternative semantical definition for ⊡.
[TABLE]
Consequently, ⊞ is deductively weaker than ⊡. In contrast, as Sec. 3 will show, ⊞ is deductively stronger than ⊡, equivalently, ⊡ is expressively weaker than ⊞.111As for the definitions of ‘deductively weaker’ and ‘expressively weaker’, we refer to [Fan17].
Note that ⊭⊞φ↔⊞¬φ but ⊨⊡φ↔⊡¬φ. To see the former, consider a model M=⟨S,R1,R2,V⟩ in which S={s,t,u}, R1(s)={t} and R2(s)={u}, and V(p)={t}. Then it should be easily verified that s⊨⊞p but s⊭⊞¬p. This will matter when we look into the differences between axiomatizations of ⊞-logics and of ⊡-logics.
We may define M,s⊨□iφ as Ri(s)⊨φ, where i∈{1,2}, then ⊞φ is equivalent to □1φ∨□2¬φ. The operator ⊞, written N′′′ on [Hum16, p. 229], to our knowledge, has not been axiomatized in the literature.
If we read □iφ as “the agent i believes that φ”, then it is not hard to see that the negation of ⊡ characterizes the notion of weak belief-disagreement in [CP18]: one agent fails to believe one proposition and the other fails to believe its negation. In that paper, the notion is mentioned in passing only, which is based on serial bimodal frames.
On serial bimodal frames, the semantics of ⊡ is equivalent to
[TABLE]
The epistemic meaning of this definition is that agents 1 and 2 have the same knowledge about φ, i.e. they both know φ, or they both know ¬φ; in a doxastic reading, it means ‘agents 1 and 2 have the belief agreement on φ’.
To simplify the proofs later, we claim the following results, which should be easily verified.
Proposition 3**.**
Let i,j∈{1,2} and i=j and Rj(s)=∅. If M,s⊨⊡φ, then M,s⊨Δiφ.
Note that the converse fails. For example, in a model M, s has only a single Ri-successor t, and another single Rj-successor u, whereas t and u have different truth values for φ. In spite of this, the converse indeed holds when Ri(s) and Rj(s) has a common element.
Proposition 4**.**
Suppose that R1(s)∩R2(s)=∅. If M,s⊨Δ1φ∧Δ2φ, then M,s⊨⊡φ.
Corollary 5**.**
Suppose that R1(s)∩R2(s)=∅. Then M,s⊨Δ1φ∧Δ2φ iff M,s⊨⊡φ.
3 Expressivity
This section compares the relative expressivity of L(⊡) and L(⊞). It turns out that the former is less expressive than the latter on all five classes of basic bimodal models.
To make our presentation self-contained, we introduce some necessary technical terms.
Definition 6**.**
Let L1 and L2 be two languages that are interpreted on the same class of models C.
L2 is at least as expressive as L1, notation: L1⪯L2, if for all φ∈L1, there exists ψ∈L2 such that for all M in C and all s in M, we have that M,s⊨φ iff M,s⊨ψ.
L1 and L2 are equally expressive, notation: L1≡L2, if L1⪯L2 and L2⪯L1.
L1 is less expressive than L2, notation: L1≺L2, if L1⪯L2 but L2⪯L1.
Proposition 7**.**
L(⊡) is less expressive than L(⊞) on the class of all bimodal models, the class of serial bimodal models, the class of transitive bimodal models, the class of Euclidean bimodal models.
Proof.
We have already seen that ⊡ is definable in L(⊞), as ⊨⊡φ↔⊞φ∧⊞¬φ. This entails that L(⊡)⪯L(⊞).
To show L(⊞)⪯L(⊡), consider the following serial, transitive, Euclidean bimodal models:
[TABLE]
One can check that M,s⊨⊞p and M′,s′⊭⊞p, thus the L(⊞)-formula ⊞p can distinguish (M,s) and (M′,s′).
However, (M,s) and (M′,s′) cannot be distinguished by any L(⊡)-formula. That is, for all φ∈L(⊡), we have (M,s⊨φ⟺M′,s′⊨φ). The proof proceeds by induction on φ.
The base case and Boolean cases are straightforward. For the case ⊡φ, we have
[TABLE]
where (∗) holds since M,t⊨φ iff M′,u′⊨φ, and M,u⊨φ iff M′,t′⊨φ for all φ∈L(⊡), as can be easily verified.
∎
Proposition 8**.**
L(⊡) is less expressive than L(⊞) on the class of symmetric bimodal models.
Proof.
Again, L(⊡)⪯L(⊞). For the strict part,
consider the following symmetric bimodal models:
[TABLE]
First, M,s⊨⊞p but M′,s′⊭⊞p. This means that (M,s) and (M′,s′) can be distinguished by L(⊞).
Second, as shown in Prop. 7, we can prove that for all φ∈L(⊡), M,s⊨φ iff M′,s′⊨φ. Then (M,s) and (M′,s′) cannot be distinguished by L(⊡).
∎
Proposition 9**.**
L(⊡) is less expressive than L(⊞) on the class of reflexive bimodal models.
Proof.
Again, L(⊡)⪯L(⊞).
For the strict part, consider the following reflexive bimodal models:
[TABLE]
First, M,s⊨⊞p but M′,s′⊭⊞p, thus ⊞p can distinguish (M,s) and (M′,s′).
However, no L(⊡)-formula can distinguish both pointed models. That is, for all φ∈L(⊡), we have (M,s⊨φ⟺M′,s′⊨φ). The proof proceeds with induction on φ. We only consider the nontrivial case ⊡φ.
[TABLE]
where (∗) is the case due to the induction hypothesis that M,s⊨φ⟺M′,s′⊨φ, and the fact that M,t⊨φ iff M′,u′⊨φ, and M,u⊨φ iff M′,t′⊨φ for all φ∈L(⊡), as can be easily verified.
∎
Remark 10**.**
Note that in the proof of Prop. 9, M and M′ are both serial and transitive, but not Euclidean; for instance, sR1t and sR1s but not tR1s, thus Prop. 7 cannot be shown by using the constructed models in Prop. 9.
The clear-sighted reader may ask whether the Euclidean closures of M and M′ in Prop. 9 can handle Prop. 7 (and even Prop. 8) uniformly. That is, if we construct models M and M′ as follows:
[TABLE]
then does M,s⊨φ⟺M′,s′⊨φ hold for all φ∈L(⊡)?
The answer seems negative. The reason is as follows: to show the case ⊡φ, that is, M,s⊨⊡φ⟺M′,s′⊨⊡φ, (as before) we need to prove that M,t⊨φ⟺M′,u′⊨φ for all φ∈L(⊡) (and also M,u⊨φ⟺M′,t′⊨φ for all φ∈L(⊡)), whose case ⊡φ relies on showing again that M,s⊨φ⟺M′,s′⊨φ for all φ∈L(⊡). This is a vicious circle.
In comparison, this situation does not occur in the proofs of Prop. 7-Prop. 9; instead, as any point x∈{t,u,t′,u′} in the proofs of those propositions has no two different successors with respect to R1 and R2, all formulas of the form ⊡φ are true at x.
4 ⊡-morphisms
In this section, we introduce a notion of ⊡-morphisms, which is useful in the proof of frame undefinability and the completeness proof of L(⊡) over serial frames and also over symmetric frames below.
Definition 11**.**
Let M=⟨S,R1,R2,V⟩ and M′=⟨S′,R1′,R2′,V′⟩ be two bimodal models. A function f:S→S′ is a ⊡-morphism from M to M′, if for all x∈S,
For all p∈P, x∈V(p) iff f(x)∈V′(p),
For any y,z∈S, if xR1y and xR2z and f(y)=f(z), then f(x)R1′f(y) and f(x)R2′f(z),
For all y′,z′∈S′, if f(x)R1′y′ and f(x)R2′z′ and y′=z′, then there are y,z∈S such that xR1y and xR2z and f(y)=y′ and f(z)=z′.
We say that M′ is a ⊡-morphic image of M, if there is a surjective ⊡-morphism from M to M′.
The following result indicates that L(⊡)-formulas and L(⊞)-formulas are invariant under ⊡-morphisms.
Proposition 12**.**
Let M=⟨S,R1,R2,V⟩ and M′=⟨S′,R1′,R2′,V′⟩ be two bimodal models, and let f be a ⊡-morphism from M to M′. Then for all x∈S, for all φ∈L(⊡)∪L(⊞), we have
[TABLE]
Proof.
By induction on φ∈L(⊡)∪L(⊞). We only consider the nontrivial case ⊡φ and ⊞φ.
Suppose that M,x⊭⊡φ, to show that M′,f(x)⊭⊡φ. By supposition, there are y,z∈S such that xR1y and xR2z and it is not the case that (M,y⊨φ⟺M,z⊨φ). By induction hypothesis, it is not the case that (M′,f(y)⊨φ⟺M′,f(z)⊨φ), which implies that f(y)=f(z). Now using (Forth), we obtain f(x)R1′f(y) and f(x)R2′f(z). Therefore, M′,f(x)⊭⊡φ.
Conversely, assume that M′,f(x)⊭⊡φ, to prove that M,x⊭⊡φ. By assumption, there exist y′,z′∈S′ such that f(x)R1′y′ and f(x)R2′z′ and it is not the case that (M′,y′⊨φ⟺M′,z′⊨φ). It is clear that y′=z′. Using (Back), we infer that there are y,z∈S such that xR1y and xR2z and f(y)=y′ and f(z)=z′, and thus it is not the case that (M′,f(y)⊨φ⟺M′,f(z)⊨φ). By induction hypothesis, it is not the case that (M,y⊨φ⟺M,z⊨φ). Therefore, M,x⊭⊡φ.
Suppose that M,x⊭⊞φ, to prove that M′,f(x)⊭⊞φ. By supposition, there exists y∈S such that xR1y and M,y⊭φ, and there exists z∈S such that xR2z and M,z⊭¬φ (viz. M,z⊨φ). By induction hypothesis, M′,f(y)⊭φ and M′,f(z)⊨φ, which implies that f(y)=f(z). Then applying (Forth), we infer that f(x)R1′f(y) and f(x)R2′f(z). Therefore, M′,f(x)⊭⊞φ.
Conversely, assume that M′,f(x)⊭⊞φ, to demonstrate that M,x⊭⊡φ. By assumption, there is a y′∈S′ such that f(x)R1′y′ and M′,y′⊭φ, and there is a z′∈S′ such that f(x)R2′z′ and M′,z′⊭¬φ (namely, M′,z′⊨φ). Then y′=z′. Applying (Back), we derive that there exist y,z∈S such that xR1y and xR2z and f(y)=y′ and f(z)=z′. Thus M′,f(y)⊭φ and M′,f(z)⊨φ. By induction hypothesis, M,y⊭φ and M,z⊨φ, and therefore M,x⊭⊞φ, as desired.
∎
5 Frame definability
This section investigates the frame definability of logics L(⊡) and L(⊞). It turns out that all five basic frame properties, i.e. seriality, reflexivity, transitivity, symmetry, Euclidicity, are not definable in both logics. For this, we adopt the notion of ⊡-morphisms on the frame level, which is obtained from Def. 11 by leaving out the valuations.
Definition 13**.**
Let F=⟨S,R1,R2⟩ and F′=⟨S′,R1′,R2′⟩ be two bimodal frames. A function f:S→S′ is a ⊡-morphism from F to F′, if for all x∈S,
For any y,z∈S, if xR1y and xR2z and f(y)=f(z), then f(x)R1′f(y) and f(x)R2′f(z),
For all y′,z′∈S′, if f(x)R1′y′ and f(x)R2′z′ and y′=z′, then there are y,z∈S such that xR1y and xR2z and f(y)=y′ and f(z)=z′.
We say that F′ is a ⊡-morphic image of F, if there is a surjective ⊡-morphism from F to F′.
Proposition 14**.**
Let F=⟨S,R1,R2⟩ and F′=⟨S′,R1′,R2′⟩ be two bimodal frames. If F′ is a ⊡-morphic image of F, then for all φ∈L(⊡)∪L(⊞), we have
[TABLE]
Proof.
Assume that F′ is a ⊡-morphic image of F. Then there is a surjective ⊡-morphism from F to F′, say f.
Suppose that F⊭φ, to show that F′⊨φ. By supposition, there exists a valuation V on F and s∈S such that ⟨F,V⟩,s⊭φ. Define a valuation V′ on F′ by V′(p)={f(x)∣x∈V(p)} for all p∈P. Then f is a ⊡-morphism from ⟨F,V⟩ to ⟨F′,V′⟩. By Prop. 12 and the fact that ⟨F,V⟩,s⊭φ, we obtain ⟨F′,V′⟩,f(s)⊭φ, and therefore F′⊭φ.
Conversely, suppose that F′⊭φ, to show that F⊭φ. By supposition, there is a valuation V′ on F′ and s′∈S′ such that ⟨F′,V′⟩,s′⊭φ. Since f is surjective, there must be an s∈S such that s′=f(s). Define a valuation V on F by V(p)={x∣f(x)∈V′(p)} for all p∈P. Then f is a ⊡-morphism from ⟨F,V⟩ to ⟨F′,V′⟩. By Prop. 12 again and the fact that ⟨F′,V′⟩,f(s)⊭φ, we infer that ⟨F,V⟩,s⊭φ, and therefore F⊭φ, as desired.
∎
Proposition 15**.**
None of seriality, reflexivity, transitivity, symmetry and Euclidicity are definable in L(⊡)∪L(⊞).
Proof.
Consider the following bimodal frames:
[TABLE]
Define a function g from F to F′ as follows: g(s)=g(t)=g(u)=s′. It is not hard to check that g is a surjective ⊡-morphism, thus F′ is a ⊡-morphic image of F. By Prop. 14, F⊨φ iff F′⊨φ for all φ∈L(⊡)∪L(⊞).
If seriality were defined by a set of L(⊡)-formulas or a set of L(⊞)-formulas, say Γ, then as F′ is serial, F′⊨Γ, and thus F⊨Γ, which would imply that F should be serial: a contradiction. Thus seriality is not definable in L(⊡). The proofs for the undefinability of other frame properties are analogous.
∎
The frame undefinability results can be understood in the following way: since in the figures of Prop. 15, we have R1=R2, and we already commented that if R1=R2, then each of ⊡ and ⊞ becomes a non-contingency operator; moreover, none of the five basic frame properties are definable in a logic with any non-contingency operator as a sole primitive modality [Zol99, FWvD15], thus Prop. 15 obtains.
6 Axiomatizations for L(⊞)
This section first presents the minimal logic for L(⊞), and shows its soundness and completeness, and then demonstrates that the same logic is also sound and strongly complete with respect to the class of serial bimodal frames.
6.1 The minimal logic and soundness
Definition 16**.**
The minimal logic for L(⊞), denoted K⊞, consists of the following axioms and inference rules:
[TABLE]
Notions of deductions and theorems are defined as normal.
Recall that in the minimal noncontingency logic, the axiom Δφ→Δ(φ∨ψ)∨Δ(φ∧χ) (denoted DISΔ hereafter) can be replaced with the rule Δψ→Δφ∨Δχφ→ψ ψ→χ [Hum02, p. 110]. This also applies to its ⊞-correspondent; more precisely, the axiom DIS⊞ is replaceable with the rule ⊞ψ→⊞φ∨⊞χφ→ψ ψ→χ, given the rule RE⊞.
Also, DISΔ can be replaced with Δφ→Δ(φ∨ψ)∨Δ(¬φ∨χ) (called ‘Kuhn’s axiom’), and even with the formula (which is equivalent to Kuhn’s axiom) with less district schematic letters Δφ→Δ(φ∨ψ)∨Δ(¬φ∨ψ), see [Hum02, pp. 110-111]. In comparison, the axiom DIS⊞ cannot be replaced with ⊞φ→⊞(φ∨ψ)∨⊞(¬φ∨χ), neither with ⊞φ→⊞(φ∨ψ)∨⊞(¬φ∨ψ), as illustrated below.
[TABLE]
On one hand, because R2(s)⊨¬p, we have s⊨⊞p. On the other hand, since R1(s)⊭p∨q (as sR1s and s⊭p∨q) and R2(s)⊭¬(p∨q) (as sR2t and t⊨p∨q), it follows that s⊭⊞(p∨q); moreover, since R1(s)⊭¬p∨q (as sR1u and u⊨p∧¬q) and R2(s)⊭¬(¬p∨q) (as sR2t and t⊨¬p∨q), it follows that s⊭⊞(¬p∨q). This indicates that ⊞p→⊞(p∨q)∨⊞(¬p∨q) is invalid.
Proposition 17**.**
K⊞ is sound with respect to the class of all bimodal frames.
Proof.
We take the validity of CON⊞ and DIS⊞ as examples. Let M=⟨S,R1,R2,V⟩ be an arbitrary bimodal model and s∈S.
Suppose that M,s⊨⊞φ∧⊞ψ. Then R1(s)⊨φ or R2(s)⊨¬φ, and R1(s)⊨ψ or R2(s)⊨¬ψ.
If R2(s)⊨¬φ or R2(s)⊨¬ψ, then R2(s)⊨¬(φ∧ψ); otherwise, that is, if R1(s)⊨φ and R1(s)⊨ψ, then R1(s)⊨φ∧ψ. Thus either R1(s)⊨φ∧ψ or R2(s)⊨¬(φ∧ψ), and therefore M,s⊨⊞(φ∧ψ).
If R1(s)⊨φ or R1(s)⊨ψ, then R1(s)⊨φ∨ψ; otherwise, that is, if R2(s)⊨¬φ and R2(s)⊨¬ψ, then R2(s)⊨¬(φ∨ψ). Thus either R1(s)⊨φ∨ψ or R2(s)⊨¬(φ∨ψ), and therefore M,s⊨⊞(φ∨ψ). Hitherto we have completed the validity of CON⊞.
Now suppose that M,s⊨⊞φ, then R1(s)⊨φ or R2(s)⊨¬φ. If it is the case that R1(s)⊨φ, then R1(s)⊨φ∨ψ, which implies that M,s⊨⊞(φ∨ψ); if it is the case that R2(s)⊨¬φ, then R2(s)⊨¬(φ∧χ), which entails that M,s⊨⊞(φ∧χ). Therefore, M,s⊨⊞(φ∨ψ)∨⊞(φ∧χ). Hitherto we have completed the validity of DIS⊞.
∎
6.2 Completeness
This part deals with the completeness of K⊞. We adopt the standard canonical model construction. However, a tricky thing is how to define two suitable canonical relations to handle the operator ⊞.
Definition 18**.**
The canonical model for K⊞ is a tuple Mc=⟨Sc,R1c,R2c,Vc⟩, where
Sc={s∣s is a maximal K⊞-consistent set};
sR1ct iff λ1(s)⊆t, where λ1(s)={φ∣⊞(φ∨ψ)∈s for all ψ};
sR2cu iff λ2(s)⊆u, where λ2(s)={φ∣⊞(¬φ∧χ)∈s for all χ};
Vc(p)={s∈Sc∣p∈s}.
As mentioned, the semantics of Δ is a special case of the semantics of ⊞ when R1=R2. In that case, we should have R1c=R2c. Indeed this is true, since in that case, ⊞φ↔⊞¬φ is valid, and then the definition of R2c is equivalent to that “for all φ, if ⊞(φ∨ψ)∈s for all ψ, then φ∈t”, that is, the definition of R1c. And in this way, we obtain the canonical relation defined in [Kuh95] as a special case.
Let us look at the properties of the two functions λ1 and λ2.
Proposition 19**.**
Let s∈Sc. Then
- (a)
λ1(s)∩λ2(s) is nonempty. Consequently, λ1(s) and λ2(s) are both nonempty.
2. (b)
λ1(s) and λ2(s) are both closed under conjunction. That is, if φ1,φ2∈λ1(s), then φ1∧φ2∈λ1(s), and similarly for λ2(s). Consequently, λ1(s) and λ2(s) are both closed under finite conjunctions.
3. (c)
If φ∈λ1(s) and ⊢φ→δ, then δ∈λ1(s), and similarly for λ2(s).
4. (d)
⊞φ∈s iff either φ∈λ1(s) or ¬φ∈λ2(s).
Proof.
- (a)
Since ⊢⊤, then applying the rule RN⊞, we have ⊢⊞⊤∧⊞¬⊤. By RE⊞, ⊞(⊤∨ψ)∈s for all ψ and ⊞(¬⊤∧χ)∈s for all χ. Therefore, ⊤∈λ1(s)∩λ2(s).
2. (b)
Suppose that φ1,φ2∈λ1(s), then ⊞(φ1∨ψ)∈s and ⊞(φ2∨ψ)∈s for all ψ. Then ⊞(φ1∨ψ)∧⊞(φ2∨ψ)∈s. Using the axiom CON⊞, we obtain ⊞((φ1∨ψ)∧(φ2∨ψ))∈s. Then applying the rule RE⊞, we infer that ⊞((φ1∧φ2)∨ψ)∈s. Since ψ is arbitrary, we now conclude that φ1∧φ2∈λ1(s).
Assume that φ1,φ2∈λ2(s), then ⊞(¬φ1∧χ)∈s and ⊞(¬φ2∧χ)∈s for all χ. Then ⊞(¬φ1∧χ)∧⊞(¬φ2∧χ)∈s. Using the axiom CON⊞, we infer ⊞((¬φ1∧χ)∨(¬φ2∧χ))∈s. Now applying the rule RE⊞, we obtain ⊞((¬(φ1∧φ2)∧χ))∈s. Since χ is arbitrary, we now conclude that φ1∧φ2∈λ2(s).
3. (c)
Suppose φ∈λ1(s) and ⊢φ→δ, to show δ∈λ1(s). By supposition, it follows that ⊢φ∨δ↔δ and ⊞(φ∨ψ)∈s for all ψ. Then ⊢φ∨(δ∨ψ)↔δ∨ψ. Applying the rule RE⊞, we derive ⊢⊞(φ∨(δ∨ψ))↔⊞(δ∨ψ). Since ⊞(φ∨(δ∨ψ))∈s, we derive that ⊞(δ∨ψ)∈s. Since ψ is arbitrary, δ∈λ1(s).
Now assume that φ∈λ2(s) and ⊢φ→δ, to show δ∈λ2(s). Since φ∈λ2(s), it follows that ⊞(¬φ∧χ)∈s for all χ. Since ⊢φ→δ, it follows that ⊢¬φ∧¬δ↔¬δ, and thus ⊢¬φ∧(¬δ∧χ)↔¬δ∧χ. Applying the rule RE⊞, we obtain ⊢⊞(¬φ∧(¬δ∧χ))↔⊞(¬δ∧χ). Since ⊞(¬φ∧(¬δ∧χ))∈s, we get ⊞(¬δ∧χ)∈s. Since χ is arbitrary, δ∈λ2(s).
4. (d)
Suppose by contraposition that φ∈/λ1(s) and ¬φ∈/λ2(s). Then ⊞(φ∨ψ)∈/s for some ψ, and ⊞(¬¬φ∧χ)∈/s for some χ, namely ⊞(φ∧χ)∈/s. Using the axiom DIS⊞, we obtain immediately ⊞φ∈/s.
Conversely, assume that either φ∈λ1(s) or ¬φ∈λ2(s). Then either ⊞(φ∨ψ)∈s for all ψ or ⊞(φ∧χ)∈s for all χ. Then either case implies that ⊞φ∈s: in the first case, letting ψ=⊥, by RE⊞ we obtain ⊞φ∈s; in the second case, let χ=⊤, by RE⊞ again, we infer that ⊞φ∈s. Therefore, ⊞φ∈s.
∎
With the above results in preparation, we can obtain the following truth lemma.
Lemma 20**.**
For all s∈Sc, for all φ∈L(⊞), we have
[TABLE]
Proof.
By induction on φ. The only nontrivial case is ⊞φ.
Assume for reductio that ⊞φ∈s but Mc,s⊭⊞φ. By induction hypothesis, there is a t such that sR1ct and φ∈/t, and there is a u such that sR2cu and ¬φ∈/u. Then by definitions of R1c and R2c, we can obtain that φ∈/λ1(s) and ¬φ∈/λ2(s). This contradicts the supposition that ⊞φ∈s and Prop. 19(d).
Conversely, suppose ⊞φ∈/s, we need to find two states t and u in Sc such that sR1ct and φ∈/t, and sR2cu and φ∈u. For this, we first show that
- (1)
λ1(s)∪{¬φ} is consistent, and
2. (2)
λ2(s)∪{φ} is consistent.
If (1) does not hold, then there exist χ1,⋯,χn∈λ1(s)222Prop. 19(a) provides the nonempty of λ1(s). such that ⊢χ1∧⋯∧χn→φ. Since χ1,⋯,χn∈λ1(s), from Prop. 19(b) it follows that χ1∧⋯∧χn∈λ1(s). Then due to Prop. 19(c), we have φ∈λ1(s), by Prop. 19(d) we conclude that ⊞φ∈s, contrary to the supposition.
If (2) does not hold, then there are ψ1,⋯,ψm∈λ2(s)333Again, Prop. 19(a) provides the nonempty of λ2(s). such that ⊢ψ1∧⋯∧ψm→¬φ. Since ψ1,⋯,ψm∈λ2(s), it follows that ψ1∧⋯∧ψm∈λ2(s) from Prop. 19(b). Then thanks to Prop. 19(c), we infer that ¬φ∈λ2(s), by Prop. 19(d) again, we derive that ⊞φ∈s, which contradicts the supposition again.
Then by Lindenbaum’s Lemma, we are done.
∎
Now it is a standard exercise to show that K⊞ is the minimal logic of L(⊞).
Theorem 21**.**
K⊞ is sound and strongly complete with respect to the class of all bimodal frames.
6.3 The serial logic
In this section, we show that K⊞ is also the serial logic of L(⊞), that is to say, K⊞ is sound and strongly complete with respect to the class of serial bimodal frames. For this, if R1c and R2c in Def. 18 are serial, then we are done. We first have the following key observation.
Proposition 22**.**
Define Mc as in Def. 18 and s∈Sc. Then the following conditions are equivalent:
-
R1c(s)=∅.
2. 2.
⊥∈/λ1(s).
3. 3.
⊞ψ∈/s for some ψ.
4. 4.
⊥∈/λ2(s).
5. 5.
R2c(s)=∅.
Proof.
We show \refprop.serial−1⟺\refprop.serial−2, \refprop.serial−2⟺\refprop.serial−3, \refprop.serial−3⟺\refprop.serial−4, and \refprop.serial−4⟺\refprop.serial−5.
∎
Proof.
\refprop.serial−1⟺\refprop.serial−2: suppose towards contradiction that R1c(s)=∅ but ⊥∈λ1(s). Then sR1ct for some t∈Sc, that is, λ1(s)⊆t, and therefore ⊥∈t: a contradiction. Conversely, assume that ⊥∈/λ1(s), we need to show that s has a R1c-successor. It suffices to show that λ1(s) is consistent. If not, there exists φ1,⋯,φn∈λ1(s) such that ⊢φ1∧⋯∧φn→⊥. Using items (b) and (c) of Prop. 19, we can derive that ⊥∈λ1(s), which is contrary to the assumption.
\refprop.serial−2⟺\refprop.serial−3: Suppose by contraposition that ⊞ψ∈s for all ψ. Since ⊢ψ↔⊥∨ψ, by RE⊞, it follows that ⊢⊞ψ↔⊞(⊥∨ψ), and then ⊞(⊥∨ψ)∈s, and therefore ⊥∈λ1(s). Conversely, assume that ⊥∈λ1(s), then ⊞(⊥∨ψ)∈s for all ψ, and thus ⊞ψ∈s for all ψ.
\refprop.serial−3⟺\refprop.serial−4: similar to the proof of \refprop.serial−2⟺\refprop.serial−3.
\refprop.serial−4⟺\refprop.serial−5: similar to the proof of \refprop.serial−1⟺\refprop.serial−2.
∎
Corollary 23**.**
Define Mc as in Def. 18. Then the following conditions are equivalent:
-
R1c is serial.
2. 2.
⊥∈/λ1(s) for any s∈Sc.
3. 3.
⊞ψ∈/s for any s∈Sc and for some ψ.
4. 4.
⊥∈/λ2(s) for any s∈Sc.
5. 5.
R2c is serial.
As we cannot exclude the possibility that ⊞ψ∈s for some s∈S and for all ψ, by the above result, we cannot provide that R1c and R2c are serial. We call such states s ‘endpoints’. By Prop. 22, s has neither R1c-successors nor R2c-successors.
We handle these endpoints by using a similar strategy of ‘reflexivizing the arrows in the canonical model’ used for showing the completeness of serial contingency logic in [Hum95, FWvD15]. In detail, define MD=⟨Sc,R1D,R2D,Vc⟩ as Mc in Def. 18, except that RiD=Ric∪{(s,s)∣s is an endpoint}. It should be obvious that MD is serial. Moreover, the truth values of L(⊞)-formulas are invariant under the model transformation: for all s∈Sc, by Prop. 22, R1c(s)=∅ iff R2c(s)=∅. If s is an endpoint, then as R1c(s)=R2c(s)=∅, it holds vacuously that Mc,s⊨⊞φ; since s⊨φ or s⊨¬φ and R1D(s)=R2D(s)={s}, we have also that MD,s⊨⊞φ. If s has both R1c- and R2c-successors, then it is clear that Mc,s⊨⊞φ iff MD,s⊨⊞φ, as desired. Consequently,
Theorem 24**.**
K⊞ is sound and strongly complete with respect to the class of serial bimodal frames.
7 Axiomatizations for L(⊡)
This section first provides the minimal logic for L(⊡) and shows its soundness and completeness, then explores its extensions over special frames.
7.1 Minimal logic
Definition 25**.**
The minimal logic of L(⊡), denoted K⊡, consists of the following axioms and inference rules:
[TABLE]
The proposition below will be used in Prop. 29.
Proposition 26**.**
The rule ⊡φ∧⊡(ψ→φ)→⊡ψφ→ψ, denoted wM⊡, is derivable in K⊡.
Proof.
Suppose that ⊢φ→ψ, then ⊢φ↔(φ∧ψ). By RE⊡, we have ⊢⊡φ↔⊡(φ∧ψ). By axiom ⊡CON, ⊢⊡(φ→¬ψ)∧⊡(¬φ→¬ψ)→⊡((φ→¬ψ)∧(¬φ→¬ψ)). Since ⊢(φ→¬ψ)∧(¬φ→¬ψ)↔¬ψ, by RE⊡ it follows that ⊢⊡((φ→¬ψ)∧(¬φ→¬ψ))↔⊡¬ψ. Using PC, ⊡EQU and RE⊡, we obtain ⊢⊡(φ∧ψ)↔⊡(φ→¬ψ) and ⊢⊡(ψ→φ)↔⊡(¬φ→¬ψ) and ⊢⊡¬ψ↔⊡ψ, and therefore ⊢⊡φ∧⊡(ψ→φ)→⊡ψ.
∎
Proposition 27**.**
K⊡ is sound with respect to the class of all bimodal frames.
Proof.
We only show the validity of axioms ⊡CON and ⊡DIS. Let M=⟨S,R1,R2,V⟩ be an arbitrary bimodal model and s∈S.
For the validity of ⊡CON, suppose that M,s⊨⊡φ∧⊡ψ, then for all t,u such that sR1t and sR2u, we have that (t⊨φ iff u⊨φ), and also that (t⊨ψ iff u⊨ψ), thus t⊨φ∧ψ iff (t⊨φ and t⊨ψ) iff (u⊨φ and u⊨ψ) iff u⊨φ∧ψ, and thus s⊨⊡(φ∧ψ).
For the validity of ⊡DIS, suppose that M,s⊨⊡φ, then for all t,u such that sR1t and sR2u, we have that (t⊨φ iff u⊨φ). If φ is true at both t and u, then so is φ∨ψ; if φ is false at both t and u, then ¬φ is true at both points, and so is ¬φ∨χ. Therefore, M,s⊨⊡(φ∨ψ)∨⊡(¬φ∨χ), as desired.
∎
In the remainder of this subsection, we show the strong completeness of K⊡. The following canonical model is inspired by that of the minimal noncontingency logic in [FWvD15] and the similarity between ⊡-axioms and Δ-axioms.
Definition 28**.**
A tuple Mc={Sc,R1c,R2c,Vc} is the canonical model of K⊡, if
Sc={s∣s is a maximal K⊡-consistent set},
For i∈{1,2}, sRict iff there exists χ such that
-
¬⊡χ∈s and
2. 2.
for all φ, if ⊡φ∧⊡(χ→φ)∈s, then φ∈t.
Vc(p)={s∈Sc∣p∈s}.
Note that R1c=R2c. This fact will make our proofs much more convenient.
Proposition 29**.**
Let s∈Sc, ⊡φ∈/s and Γ(s)={ψ∣⊡ψ∧⊡(φ→ψ)∈s}. Then
-
Γ(s) is nonempty.
2. 2.
If ψ,χ∈Γ(s), then ψ∧χ∈Γ(s).
3. 3.
If ψ∈Γ(s), then ⊬ψ→φ.
4. 4.
Γ(s)∪{φ} and Γ(s)∪{¬φ} are both consistent.
Proof.
Suppose that the preconditions hold. Then ⊡¬φ∈/s.
-
Straightforward because ⊢⊡⊤.
2. 2.
Assume that ψ,χ∈Γ(s), then ⊡ψ∧⊡(φ→ψ)∈s and ⊡χ∧⊡(φ→χ)∈s. By axiom ⊡CON, it follows that ⊡(ψ∧χ)∧⊡(φ→ψ∧χ)∈s, and therefore ψ∧χ∈Γ(s).
3. 3.
Assume for reductio that ψ∈Γ(s) and ⊢ψ→φ. Then ⊡ψ∧⊡(φ→ψ)∈s and ⊢⊡ψ∧⊡(φ→ψ)→⊡φ (by the rule wM⊡ in Prop. 26), and therefore ⊡φ∈s, which contradicts the supposition that ⊡φ∈/s.
4. 4.
Assume that Γ(s)∪{φ} is inconsistent, then there exists ψ1,⋯,ψm∈Γ(s) (1 provides the nonempty of Γ(s)) such that ⊢ψ1∧⋯∧ψm→¬φ. By application of 2 for m−1 times, we can obtain that ψ1∧⋯∧ψm∈Γ(s), which contradicts 3. Thus Γ(s)∪{φ} is consistent. Similarly, we can conclude that Γ(s)∪{¬φ} is consistent.
∎
Lemma 30** (Truth Lemma for K⊡).**
For all s∈Sc, for all φ∈L(⊡), we have
[TABLE]
Proof.
By induction on φ∈L(⊡). The nontrivial case is ⊡φ.
Suppose that ⊡φ∈s (thus ⊡¬φ∈s), to show that Mc,s⊨⊡φ. If not, by induction hypothesis, there exist t,u∈Sc such that sR1ct and sR2cu and it is not the case that (φ∈t iff φ∈u). W.l.o.g. we may assume444This is because R1c=R2c. that φ∈t but φ∈/u. From sR1ct, it follows that there exists χ such that ¬⊡χ∈s and (1) for all φ, if ⊡φ∧⊡(χ→φ)∈s, then φ∈t. Since ¬φ∈/t and ⊡¬φ∈s, by (1) we have ⊡(χ→¬φ)∈/s, namely ⊡(¬φ∨¬χ)∈/s. Similarly, from sR2cu and φ∈/u, we can show that for some ψ, ⊡(ψ→φ)∈/s, that is, ⊡(φ∨¬ψ)∈/s. Now by axiom ⊡DIS, we obtain that ⊡φ∈/s, which is contrary to the supposition.
Conversely, assume that ⊡φ∈/s, we need to find two states t,u∈Sc such that sR1ct and sR2cu and it is not the case that (φ∈t iff φ∈u). Define Γ(s) as in Prop. 29. By Prop. 29.4, Γ(s)∪{φ} and Γ(s)∪{¬φ} are both consistent. Then by Lindenbaum’s Lemma, there are two states t,u∈Sc such that sR1ct and sR2cu such that φ∈t and φ∈/u, and thus it is not the case that (φ∈t iff φ∈u), as desired.
∎
The strong completeness is now a standard exercise.
Theorem 31**.**
K⊡ is sound and strongly complete with respect to the class of all bimodal frames.
7.2 Extensions
In this section, we study the axiomatizations of L(⊡) over special frames. The following table lists extra axioms and proof systems, and the frame properties that the corresponding systems characterize.
[TABLE]
In the above table, qt,pt,qe,pe abbreviate quasi-transitivity, pseudo-transitivity, quasi-Euclidicity and pseudo-Euclidicity, respective, which are formalized by ∀xyz(xRiy∧yRjz→xRjz), ∀xyz(xRiy∧yRjz→xR1z∧xR2z), ∀xyz(xRiy∧xRjz→yRjz), and ∀xyz(xRiy∧xRjz→yR1z∧yR2z), respectively, where i,j∈{1,2}.
7.2.1 Serial logic
Thm. 31 shows that K⊡ is the minimal ⊡-logic. We now demonstrate that the same system is also the serial ⊡-logic, that is, K⊡ is also sound and strongly complete with respect to the class of serial bimodal frames. For this, we only need to show that R1c and R2c are both serial, which though cannot be guaranteed due to the possibility that all formulas of the form ⊡φ belongs to some state. Due to the fact that R1c=R2c, we call the points that have neither R1c- nor R2c-successors ‘Rc-dead points’.555Notice that as R1c=R2c, for all s∈Sc, s either has both R1c- and R2c-successors, or has neither of them. We handle these points by using a similar strategy to the completeness proof of K⊞ over serial frames (see the remarks before Thm. 24). In detail, define MD=⟨Sc,R1D,R2D,Vc⟩ as Mc in Def. 28, except that RiD=Ric∪{(s,s)∣s is a Rc-dead points}. It should be obvious that MD is serial. Moreover, the truth values of L(⊡)-formulas are invariant under the model transformation: for all s∈Sc, if s has both R1c- and R2c-successors, then it is clear that Mc,s⊨⊡φ iff MD,s⊨⊡φ; if s is a Rc-dead point, then Mc,s⊨⊡φ and MD,s⊨⊡φ, as desired.
The above strategy indicates that Mc can be transformed into an equivalent serial bimodal model. In the sequel, we will show a stronger result: every bimodal model can be transformed into an equivalent serial bimodal model; more precisely, each bimodal model is a ⊡-morphic image of some serial bimodal model.
Given a bimodal model M=⟨S,R1,R2,V⟩, each world s in S has four possibilities: s has neither R1-successors nor R2-successors, s has R1-successors but has no R2-successors, s has no R1-successors but has R2-successors, s has both R1-successors and R2-successors. We handle this four different kinds of worlds in different ways, based on the following key observations.
-
s has neither R1-successors nor R2-successors. In this case, we just add the R1 and R2 arrows from s to itself.
2. 2.
s has R1-successors but has no R2-successors. In this case, we first replace s with some of its new copies, such that each copy has only one R1-successor, then add the R2-arrow from each copy to its sole R1-successor.
3. 3.
s has no R1-successors but has R2-successors. The method for dealing with this case is similar to that for the second case. We first replace s with some of its new copies, such that each copy has only one R2-successor, then add the R1-arrow from each copy to its sole R2-successor.
4. 4.
s has both R1-successors (say t) and R2-successors (say u). In this case, if for instance, t lies in the first case or the current case, we just keep the point t and the arrow from s to t. However, if t lies in other two cases, then we cannot simply do the same thing (otherwise the truth values of formulas may change during the tranformation); instead, we need to replace t with some of its new copies and deal with t in the same way as in the second and third cases.
Let M=⟨S,R1,R2,V⟩. Define E1={s∈S∣sR1t for some t∈S} and E2={s∈S∣sR2t for some t∈S}, and let E1=S\E1 and E2=S\E2.
It is not hard to see that S can be partitioned into four areas: E1∩E2, E1∩E2, E1∩E2 and E1∩E2.
Definition 32**.**
Given any bimodal model M=⟨S,R1,R2,V⟩, we construct a bimodal model M′=⟨S′,R1′,R2′,V′⟩, where
S′=(E1∩E2)∪(E1∩E2)∪{(s,t,1)∣s∈E1∩E2,sR1t}∪{(s,t,2)∣s∈E1∩E2,sR2t}
sR1′t iff one of the following conditions holds:
-
s∈E1∩E2 and s=t
2. 2.
s∈E1∩E2 and sR1t and t∈(E1∩E2)∪(E1∩E2)
3. 3.
s∈E1∩E2 and t=(t′,u,i)∈S′ and sR1t′, where i∈{1,2}
4. 4.
s=(s′,t,i)∈S′ and t∈(E1∩E2)∪(E1∩E2), where i∈{1,2}
5. 5.
s=(s′,t′,i)∈S′ and t=(t′,u′,j)∈S′, where i,j∈{1,2}
sR2′t iff one of the following holds:
-
s∈E1∩E2 and s=t
2. 2.
s∈E1∩E2 and sR2t and t∈(E1∩E2)∪(E1∩E2)
3. 3.
s∈E1∩E2 and t=(t′,u,i)∈S′ and sR2t′, where i∈{1,2}
4. 4.
s=(s′′,t,i)∈S′ and t∈(E1∩E2)∪(E1∩E2), where i∈{1,2}
5. 5.
s=(s′′,t′′,i)∈S′ and t=(t′′,u′′,j)∈S′, where i,j∈{1,2}
V′(p)={s∈S′∣g(s)∈V(p)}, where g is a function from S′ to S such that g(s)=s for s∈(E1∩E2)∪(E1∩E2), and g((s,t,i))=s for (s,t,i)∈S′ where i∈{1,2}.
It would be constructive to give a concrete example. We choose the following example to cover all conditions in the definitions of the relations R1′ and R2′ (for the sake of simplicity, we leave out the valuations).
Example 33**.**
[TABLE]
In the left-hand model M, it is not hard to see that s∈E1∩E2, u∈E1∩E2, v∈E1∩E2, and t,w∈E1∩E2. Thus in the right-hand model M′, s,t,w are kept unchanged, whereas u and v are replaced by their new copies (u,v,2) (since uR2v), (v,w,1) (since vR1w), respectively.
Now for the arrows in M′, viz. accessibility relations. The 1- and 2-arrows from t to itself and from w to itself are obtained from the first conditions of (the definitions of) R1′ and R2′. The 1- and 2-arrows from s to t follow from the second conditions of R1′ and R2′. The 1-arrow from s to (u,v,2) is derived from the third condition of R1′. The 2-arrow from s to (v,w,1) is deduced from the third condition of R2′. The 1- and 2-arrows from (v,w,1) to w are inferred due to the fourth conditions of R1′ and R2′. The 1- and 2-arrows from (u,v,2) to (v,w,1) are concluded by the fifth conditions of R1′ and R2′. In this way, we transform the non-serial model M into the desired serial model M′.
The following proposition states that M′ constructed via Def. 32 is indeed serial.
Proposition 34**.**
M′ is serial.
Proof.
Let s∈S′ be arbitrary. We need to show that there are x,y∈S′ such that sR1′x and sR2′y.
According to the definition of S′, we distinguish the following cases.
-
s∈E1∩E2. Then by the first conditions of the definitions of R1′ and R2′, s is the desired x and y.
2. 2.
s∈E1∩E2. Then sR1t for some t∈S. We consider all possibilities of t as follows.
- (a)
t∈(E1∩E2)∪(E1∩E2). According to the second condition of the definition of R1′, we have sR1′t, and thus t is the desired x.
2. (b)
t∈(E1∩E2)∪(E1∩E2). Then tRiu for some u∈Sc, where the value of i depends on t: if t∈E1∩E2, then i=1; otherwise i=2. Then (t,u,i)∈S′. According to the third condition of the definition of R1′, we infer sR1′(t,u,i), thus (t,u,i) is the desired x.
We have also sR2u for some u∈S. With a similar argument, we can obtain sR2′y for some y∈S′.
3. 3.
s=(s′,t,i)∈S′ where i∈{1,2}. Then s′∈Ei∩Ej and s′Rit, where j∈{1,2} and j=i. Again, since t∈S, we consider all possibilities of t as follows.
- (a)
t∈(E1∩E2)∪(E1∩E2). According to the fourth conditions of the definitions of R1′ and R2′, we get sR1′t and sR2′t, and thus t is the desired x and y.
2. (b)
t∈(E1∩E2)∪(E1∩E2). Then tRku for some u∈S, where the value of k depends on t: if t∈E1∩E2, then k=1; otherwise k=2. Then (t,u,k)∈S′. According to the fifth conditions of the definitions of R1′ and R2′, we have sR1′(t,u,k) and also sR2′(t,u,k), and thus (t,u,k) is the desired x and y.
We have thus shown that in all cases, there always exist x,y∈S′ such that sR1′x and sR2′y, as desired.
∎
The proposition below indicates that g satisfies the condition (Forth) of a ⊡-morphism.
Proposition 35**.**
If sR1′t and sR2′u and g(t)=g(u), then g(s)R1g(t) and g(s)R2g(u).
Proof.
Suppose that sR1′t and sR2′u and g(t)=g(u), thus t=u. Since s∈S′, we consider the following cases.
-
s∈E1∩E2. According to the first condition of the definition of R1′ and R2′, we would have s=t and s=u, which implies that t=u. Contradiction.
2. 2.
s∈E1∩E2. Then g(s)=s. Since sR1′t and sR2′u, according to the second and third conditions of the definitions of R1′ and R2′, we consider four subcases.
- (a)
sR1t and t∈(E1∩E2)∪(E1∩E2) and sR2u and u∈(E1∩E2)∪(E1∩E2). In this case, we have g(t)=t and g(u)=u, and therefore g(s)R1g(t) and g(s)R2g(u).
2. (b)
sR1t and t∈(E1∩E2)∪(E1∩E2) and u=(u′,y,i)∈S′ and sR2u′, where i∈{1,2}. In this case, g(t)=t and g(u)=u′, and therefore g(s)R1g(t) and g(s)R2g(u).
3. (c)
t=(t′,x,i)∈S′ and sR1t′, where i∈{1,2} and sR2u and u∈(E1∩E2)∪(E1∩E2). In this case, g(t)=t′ and g(u)=u, and then g(s)R1g(t) and g(s)R2g(u).
4. (d)
t=(t′,x,i)∈S′ and sR1t′ and u=(u′,y,j)∈S′ and sR2u′, where i,j∈{1,2}. In this case, we have g(t)=t′ and g(u)=u′, and therefore g(s)R1g(t) and g(s)R2g(u).
3. 3.
s is of the form (x,y,i)∈S′, where i∈{1,2}. Since sR1′t and sR2′u, according to the fourth and fifth conditions of the definitions of R1′ and R2′, we consider four subcases.
- (a)
s=(s′,t,i)∈S′ and s=(s′′,u,j)∈S′ and t,u∈(E1∩E2)∪(E1∩E2), where i,j∈{1,2}. In this case, we would have t=u: a contradiction.
2. (b)
s=(s′,t,i)∈S′ and t∈(E1∩E2)∪(E1∩E2) and u=(t,y,j)∈S′, where i,j∈{1,2}. In this case, t∈(E1∩E2)∪(E1∩E2): a contradiction.
3. (c)
s=(s′′,u,i)∈S′ and u∈(E1∩E2)∪(E1∩E2) and t=(u,x,j)∈S′, where i,j∈{1,2}. In this case, u∈(E1∩E2)∪(E1∩E2): a contradiction.
4. (d)
s=(s′,t′,i)∈S′ and t=(t′,x,j)∈S′ and u=(t′,y,k)∈S′, where i,j,k∈{1,2}. In this case, we would have g(t)=g(u)=t′: a contradiction.
∎
It is worth remarking that the precondition ‘g(t)=g(u)’ in the statement of the above proposition cannot be weakened to ‘t=u’. For instance, in M, s′R1t′ and t′R1x and t′R1y and x=y but s′ and t′ both have no R2-successors. According to the fifth conditions of our definitions of R1′ and R2′, in M′, (s′,t′,1)R1′(t′,x,1) and (s′,t′,1)R2′(t′,y,1) and (t′,x,1)=(t′,y,1). However, g(s′,t′,1)=s′, which implies that g(s′,t′,1) has no R2-successors, thus we have no g(s′,t′,1)R2g(t′,y,1).
The following result states that g also satisfies the condition (Back) of a ⊡-morphism.
Proposition 36**.**
If g(s)R1t′ and g(s)R2u′ and t′=u′, then there are t and u in S′ such that sR1′t and sR2′u and g(t)=t′ and g(u)=u′.
Proof.
We show a stronger result:
(∗) If g(s)R1t′ and g(s)R2u′, then there are t and u in S′ such that sR1′t and sR2′u and g(t)=t′ and g(u)=u′.
Assume that g(s)R1t′ and g(s)R2u′. It is easy to see that g(s)∈E1∩E2. Then we must have g(s)=s: otherwise, by the definition of g, g(s)=s′ and s=(s′,x,i)∈S′ where i∈{1,2}, then s′∈E1∩E2 and either s′∈E1∩E2 or s′∈E1∩E2, which is impossible. Thus sR1t′ and sR2u′. Since t′∈S, we have the following cases.
t′∈(E1∩E2)∪(E1∩E2). Then by the second conditions of R1′, it follows that sR1′t′; by the definition of g, g(t′)=t′. Therefore, t′ is the desired t.
t′∈Ei∩Ej, where i,j∈{1,2} and i=j.
In this case, t′Rix for some x, then (t′,x,i)∈S′. By the third condition of the definition of R1′, sR1′(t′,x,i); by the definition of g, g(t′,x,i)=t′. Therefore, (t′,x,i) is the desired t.
We have thus shown that there exists t∈S′ such that sR1′t and g(t)=t′.
Similarly, from u′∈S and sR2u′, we can show that there exists u∈S′ such that sR2′u and g(u)=u′, as desired.
∎
We have now shown that g is a ⊡-morphism from M′ to M. Then by Prop. 12, we immediately have
Lemma 37**.**
For all s∈S′, for all φ∈L(⊡), we have
[TABLE]
To show the completeness, we also need the following result.
Lemma 38**.**
g is surjective.
Proof.
Suppose that s∈S, to find a x∈S′ such that g(x)=s. We consider two cases.
s∈(E1∩E2)∪(E1∩E2). According to the definition of g, we have g(s)=s; clearly, s∈S′.
s∈Ei∩Ej, where i,j∈{1,2} and i=j. Then sRit for some t. It follows that (s,t,i)∈S′. By the definition of g, we have g(s,t,i)=s.
∎
Theorem 39**.**
K⊡ is sound and strongly complete with respect to the class of serial bimodal frames.
Proof.
Let Γ be a consistent set. By Thm. 31, Γ is satisfiable in a bimodal model, say (M,s). We then construct M′ from M as in Def. 32. By Lemma 38, there exists x∈S′ such that g(x)=s, and thus M,g(x)⊨Γ. Then by Lemma 37, M′,x⊨Γ. We also know that M′ is serial by Prop. 34. Therefore, Γ is satisfiable in a serial bimodal model, as desired.
∎
7.2.2 Reflexive logic
In this section, we show that KT⊡ is sound and strongly complete with respect to the class of reflexive bimodal frames. As we will see, KT⊡ is also sound and strongly complete with respect to the class of bimodal frames ⟨S,R1,R2⟩ where either R1 or R2 is reflexive.
Proposition 40**.**
⊡T is valid on the class of reflexive bimodal frames.
Proof.
Let M=⟨S,R1,R2,V⟩ be an arbitrary reflexive bimodal model and s∈S. Suppose that M,s⊨φ∧⊡φ∧⊡(φ→ψ), to show that s⊨⊡ψ. Since s∈R1(s)∩R2(s), by Coro. 5, from M,s⊨⊡φ∧⊡(φ→ψ) it follows that s⊨Δ1φ∧Δ2φ∧Δ1(φ→ψ)∧Δ2(φ→ψ). By the obtained result,666That is, φ∧Δφ∧Δ(φ→ψ)→Δψ is valid over the class of reflexive frames ⟨S,R⟩, see e.g. [FWvD15]. we can show that s⊨Δ1ψ∧Δ2ψ. Now using Coro. 5, we conclude that M,s⊨⊡ψ.
∎
As one may easily verify, the above statement still holds if the class of reflexive bimodal frames is enlarged to the class of bimodal frames where at least one accessibility relation is reflexive, that is, ⊡T is valid over bimodal frames ⟨S,R1,R2⟩ where R1 or R2 is reflexive.
Definition 41**.**
Define Mc w.r.t. KT⊡ as in Def. 28. We say Mr=⟨Sc,R1r,R2r,Vc⟩ is the reflexive closure of Mc, if for all i∈{1,2}, Rir is the reflexive closure of Ric; in symbol, Rir=Ric∪{(s,s)∣s∈S} for i∈{1,2}.
It is clear that Mr is a reflexive bimodal model.
Lemma 42** (Truth Lemma for KT⊡).**
For all s∈Sc, for all φ∈L(⊡), we have
[TABLE]
Proof.
By induction on φ. We only consider the nontrivial case ⊡φ, that is to show, ⊡φ∈s iff Mr,s⊨⊡φ.
‘If’: straightforward by Lemma 30 and the fact that Ric⊆Rir for i∈{1,2}.
‘Only if’: Suppose, for a contradiction, that ⊡φ∈s but Mr,s⊭⊡φ. By induction hypothesis, there exist t,u∈Sc such that sR1rt and sR2ru and (φ∈t⟺φ∈u). W.l.o.g. we may assume that φ∈t but φ∈/u. If s=t and s=u, then sR1ct and sR2cu, and thus the proof continues as in the corresponding part in Lemma 30, and finally we can arrive at a contradiction. If s=t or s=u, w.l.o.g. we assume that s=t, and thus s=u (as t=u), hence sR2cu.
Since s=t and φ∈t, we have φ∈s. Because sR2cu, there is a χ such that ¬⊡χ∈s and (†): for all ψ, if ⊡ψ∧⊡(χ→ψ)∈s, then ψ∈u. By supposition ⊡φ∈s and the fact that φ∈/u, we derive that ⊡(χ→φ)∈/s, that is, ⊡(φ∨¬χ)∈/s. Moreover, by axiom ⊡T, ⊢φ→[⊡φ→(⊡(φ→χ)→⊡χ)], then as φ∧⊡φ∧¬⊡χ∈s, ⊡(¬φ∨χ)∈/s. Now by axiom ⊡DIS, it follows that ⊡φ∈/s: a contradiction again.
∎
It is natural to ask if the above claim can be generalized to any bimodal model, that is, if every bimodal model has an equivalent reflexive closure. The answer is negative. For example, the following are a bimodal model and its reflexive closure, but one may check that M,w⊨⊡p whereas Mr,w⊭⊡p.
[TABLE]
With the soundness of K⊡ (Thm. ), Prop. 40 and its subsequent remark, Lindenbaum’s Lemma, and Lemma 42 in hand, the following result now follows straightforwardly.
Theorem 43**.**
KT⊡ is sound and strongly complete with respect to the class of reflexive bimodal frames, and also with respect to the class of bimodal frames ⟨S,R1,R2⟩ where either R1 or R2 is reflexive.
7.2.3 Symmetric logic
This part deals with the soundness and strong completeness of KB⊡ over the class of symmetric bimodal frames. For the soundness, it suffices to show the validity of ⊡B. Recall that ⊡B denotes φ→⊡((⊡φ∧⊡(φ→ψ)∧¬⊡ψ)→χ).
Proposition 44**.**
⊡B is valid over the class of symmetric bimodal frames.
Proof.
Let M=⟨S,R1,R2,V⟩ be a symmetric bimodal model and s∈S. Suppose, for a contradiction, that M,s⊨φ but M,s⊭⊡((⊡φ∧⊡(φ→ψ)∧¬⊡ψ)→χ). Then there exist t,u such that sR1t and sR2u such that it is not the case that (t⊨(⊡φ∧⊡(φ→ψ)∧¬⊡ψ)→χ iff u⊨(⊡φ∧⊡(φ→ψ)∧¬⊡ψ)→χ). W.l.o.g. we may assume that u⊭(⊡φ∧⊡(φ→ψ)∧¬⊡ψ)→χ, i.e. u⊨(⊡φ∧⊡(φ→ψ)∧¬⊡ψ)∧¬χ.777The other case that t⊭(⊡φ∧⊡(φ→ψ)∧¬⊡ψ)→χ can be shown similarly, by using the symmetry of R1 instead.
By u⊨¬⊡ψ, there are v,w such that uR1v and uR2w and (v⊨ψ⟺w⊨ψ). Since sR2u and R2 is symmetric, we have uR2s. Since s⊨φ and u⊨⊡φ and uR1v, it follows that v⊨φ, and thus w⊨φ. Together with (v⊨ψ⟺w⊨ψ), this implies that u⊭⊡(φ→ψ): a contradiction.
∎
For the strong completeness, we adopt the following strategy: first show that KB⊡ is strongly complete with respect to the class of quasi-symmetric bimodal frames, then demonstrate that every quasi-symmetric bimodal model is a ⊡-morphic image of some symmetric bimodal model.
We first note that φ→⊡(⊡φ∧⊡(φ→ψ)∧¬⊡ψ), denoted by w⊡B, is derivable in KB⊡.
Proposition 45**.**
Let i∈{1,2} and s,t∈Sc such that ¬⊡χ∈t. If sRict, then tRics.
Proof.
Suppose, for a contradiction, that ¬⊡χ∈t and sRict where i∈{1,2} but it is not the case that tRics. Then from sRict, it follows that there exists ψ such that ¬⊡ψ∈s and (⋆): for all δ, if ⊡δ∧⊡(ψ→δ)∈s, then δ∈t. From ¬⊡χ∈t and ∼tRics, it follows that there exists φ such that ⊡φ∧⊡(χ→φ)∈t but φ∈/s (that is, ¬φ∈s). By axiom ⊡B, ⊡((⊡¬φ∧⊡(¬φ→¬χ)∧¬⊡¬χ)→¬ψ)∈s; by w⊡B, ⊡(⊡¬φ∧⊡(¬φ→¬χ)∧¬⊡¬χ)∈s. Using axioms ⊡Equ and PC and the rule RE⊡, we can show that ⊡¬(⊡φ∧⊡(χ→φ)∧¬⊡χ)∈s and ⊡(ψ→¬(⊡φ∧⊡(χ→φ)∧¬⊡χ))∈s. Then by (⋆), ¬(⊡φ∧⊡(χ→φ)∧¬⊡χ))∈t: a contradiction.
∎
Proposition 46**.**
Let s∈Sc. Then the following conditions are equivalent:
(1) ¬⊡χ∈s for some χ;
(2) sR1ct for some t;
(3) sR2cu for some u.
Proof.
(1)⇒(2)&(3) can be obtained from item 4 of Prop. 29, whereas (2)⇒(1) and (3)⇒(1) follows from the definitions of R1c and R2c.
∎
As a corollary of Prop. 45 and Prop. 46, we obtain the following result.
Corollary 47**.**
Let i,j∈{1,2} and s,t∈Sc such that tRjcu for some u∈Sc. If sRict, then tRics.888In fact, we can get an alternative result: let i,j∈{1,2} and s,t∈Sc such that ¬⊡χ∈t. If sRict, then tRjcs. This is due to the fact that R1c=R2c. But for our purpose of showing that every quasi-symmetric bimodal model is a ⊡-morphic image of some symmetric bimodal model, we do not need the stronger correspondent (we say ‘stronger’ because in any quasi-symmetric bimodal model M=⟨S,R1,R2,V⟩, we do not have R1=R2 in general).
Given a bimodal model M=⟨S,R1,R2,V⟩, M is quasi-symmetric, if for i,j∈{1,2}, for all s,t∈S with tRju for some u∈S, sRit implies tRis. Intuitively, for any point in a quasi-symmetric model, if it has a successor with respect to some index, then there is a converse arrow with respect to an index from that point to its predecessor (if any). With the notion in mind, it follows from Lemma 30 and Coro. 47 that
Theorem 48**.**
KB⊡ is strongly complete with respect to the class of quasi-symmetric bimodal frames.
Given a quasi-symmetric bimodal model M=⟨S,R1,R2,V⟩, to build a desired symmetric bimodal model, we need only handle those states in M that have either R1-predecessors or R2-predecessors but have neither R1-successors nor R2-successors. We collect as T1 those states in M that have R1-predecessors but have neither R1-successors nor R2-successors, and collect as T2 those states in M that have R2-predecessors but have neither R1-successors nor R2-successors. In symbol,
[TABLE]
[TABLE]
and we also define T1=S\T1 and T2=S\T2.
Definition 49**.**
Given any quasi-symmetric bimodal model M=⟨S,R1,R2,V⟩, we define a bimodal model M+=⟨S+,R1+,R2+,V+⟩ in which
S+=T1∪T2∪{(s,t,1)∣t∈T1 and sR1t}∪{(s,t,2)∣t∈T2 and sR2t}.
sR1+t iff one of the following conditions holds:
- (i)
t∈T1 and sR1t
2. (ii)
t=(s,t′,1)∈S+
3. (iii)
s=(t,s′,1)∈S+
sR2+t iff one of the following conditions holds:
- (i)
t∈T2 and sR2t
2. (ii)
t=(s,t′′,2)∈S+
3. (iii)
s=(t,s′′,2)∈S+
V+(p)={s∈S+∣h(s)∈V(p)}, where h is a function from S+ to S such that h(s)=s for s∈T1∪T2, and h((s,t,i))=t for (s,t,i)∈S+, where i∈{1,2}.
Note that M+ in [FWvD14, Def. 5.9] is a special case of M+ here when R1+=R2+=R+, since Mc therein is an almost symmetric model and thus a quasi-symmetric model, and the condition that p∈h(s) is equivalent to the condition that h(s)∈Vc(p). Note that for instance, the condition (i) in the definition of R1+ is equivalent to the more complex one ‘s,t∈T1 and sR1t’, since sR1t implies that s∈T1, and similarly for other conditions. An analogous simplification goes also to the cases (i)-(iii) in the definition R+ in [FWvD14, Def. 5.9].999In detail, the definition of R+ in [FWvD14, Def. 5.9] can be simplified into the following: sR+t iff one of the following cases holds: (i) t∈D and sRct, (ii) t=(s,s′)∈S+, (iii) s=(t,t′)∈S+.
Prop. 50—Prop. 52 together say that h is a surjective ⊡-morphism, and therefore M is a ⊡-morphic image of M+.
Proposition 50**.**
[Forth] If sR1+t and sR2+u and h(t)=h(u), then h(s)R1h(t) and h(s)R2h(u).
Proof.
We show a stronger result:
(∗) If sR1+t and sR2+u and t=u, then h(s)R1h(t) and h(s)R2h(u).
Suppose that sR1+t and sR2+u and t=u. Then the arrows from s to t and u are both impossible to be constructed by the condition (iii), since otherwise s=(t,s′,1) and s=(u,s′′,2), which would entail that t=u, contradiction. In the sequel, it suffices to consider the remaining two conditions.
Since sR1+t, if t∈T1 and sR1t, then obviously s∈T1, thus h(s)=s and h(t)=t, and therefore h(s)R1h(t); if t=(s,t′,1)∈S+, then sR1t′, obviously s∈T1, thus h(s)=s and h(t)=t′, and therefore h(s)R1h(t). Similarly, we can show h(s)R2h(u) by using sR2+u instead.
∎
Proposition 51**.**
[Back]
If h(s)R1t′ and h(s)R2u′ and t′=u′, then there exist t,u∈S+ such that sR1+t,sR2+u and h(t)=t′ and h(u)=u′.
Proof.
We show a stronger result:
(⋆) For any i∈{1,2}, if h(s)Rit′, then there exist t∈S+ such that sRi+t and h(t)=t′.
Let i∈{1,2}. Suppose that h(s)Rit′. It is clear that h(s)∈T1∩T2. Then it must be that h(s)=s: otherwise, h(s)=s′ for s=(t,s′,j)∈S+, where j∈{1,2}, which would imply that s′∈T1∩T2 and s′∈T1∪T2, which is a contradiction. Hence sRit′. Since t′∈S, t′∈Ti or t′∈Ti. If t′∈Ti, then by the first condition of the definition of Ri+, we infer sRi+t′; by the definition of h, h(t′)=t′. If t′∈Ti, then (s,t′,i)∈S+, and thus by the second condition of the definition of Ri+, we derive sRi+(s,t′,i); by the definition of h, we get h((s,t′,i))=t′, as desired.
∎
Proposition 52**.**
The function h is surjective.
Proof.
Suppose that s∈S, we need to find a s′∈S+ such that h(s′)=s.
If s∈T1, then s∈S+ and h(s)=s; otherwise, s∈T1, then there exists x∈S such that xR1s, thus (x,s,1)∈S+, and then h((x,s,1))=s, as desired.
∎
Now using Prop. 12, we immediately have
Lemma 53**.**
For all s∈S+, for all φ∈L(⊡), we have
[TABLE]
To finish the completeness of KB⊡, we need also show that M+ is symmetric.
Lemma 54**.**
M+ is symmetric.
Proof.
We need to show that R1+ and R2+ are both symmetric. We show only the symmetry of R1+, since the symmetry of R2+ can be proved analogously.
Suppose for any s,t∈S+ we have sR1+t, to show that tR1+s. According to the definition of R+, we consider three conditions.
t∈T1 and sR1t. Then tRju for some u∈S, where j∈{1,2}. Since M is quasi-symmetric, we have tR1s. Obviously, s∈T1. It then follows that tR1+s.
t=(s,t′,1)∈S+ for some t′. By the third condition of the definition of R1+, it follows that tR1+s.
s=(t,s′,1)∈S+ for some s′. By the second condition of the definition of R1+, it follows that tR1+s.
∎
Theorem 55**.**
KB⊡ is strongly complete with respect to the class of symmetric bimodal frames.
Proof.
Let Σ be a consistent set. By Thm. 48, Σ is satisfiable in a quasi-symmetric bimodal model, say (M,s). Construct M+ from M as in Def. 49. As h is surjective (Prop. 52), there exists x∈S+ such that h(x)=s, thus M,h(x)⊨Σ. By Lemma 53 and Lemma 54, Σ is satisfiable in a symmetric bimodal model M+, as required.
∎
7.2.4 Transitive-like and Euclidean-like logics
In contingency logic, Δφ→Δ(Δφ∨ψ) and ¬Δφ→Δ(¬Δφ∨ψ), are added in the minimal contingency logic to axiomatize the class of transitive frames and the class of Euclidean frames, respectively, see e.g. [FWvD15]. It is then quite natural to expect that their ⊡-counterparts ⊡φ→⊡(⊡φ∨ψ) (denoted ⊡4) and ¬⊡φ→⊡(¬⊡φ∨ψ), can be used to axiomatize this generalized logic over the same classes. Unfortunately, it turns out to be wrong, since ⊡4 and ⊡5 are not sound. In what follows, instead of showing this directly, we show that one of the weaker versions of each of them, viz. ⊡φ→⊡⊡φ (denoted w⊡4) and ¬⊡φ→⊡¬⊡φ (denoted w⊡5), are invalid over the corresponding frame class.
Proposition 56**.**
w⊡4 is invalid over the class of transitive bimodal frames.
Proof.
Consider the following model M=⟨S,R1,R2,V⟩:
[TABLE]
It can be checked easily that both R1 and R2 are transitive, and thus M is transitive. On one hand, since all R1-successors u and R2-successors t of s agree on the truth value of p, we have s⊨⊡p. On the other hand, because some R1-successor u and some R2-successor w of u do not agree on the truth value of p, we obtain u⊭⊡p; since t has no any successors, t⊨⊡p, and thus s⊭⊡⊡p. Therefore, s⊭⊡p→⊡⊡p.
∎
Proposition 57**.**
w⊡5 is invalid over the class of Euclidean bimodal frames.
Proof.
Consider the following Euclidean model M′=⟨S,R1,R2,V⟩:
[TABLE]
On one hand, s⊨¬⊡p: because sR1s and sR2t and s⊨p but t⊭p. On the other hand, s⊭⊡¬⊡p: as t has only a single successor, t⊨⊡p, i.e. t⊭¬⊡p, and thus s⊭⊡¬⊡p. Therefore, s⊭¬⊡p→⊡¬⊡p.
∎
Denote K4⊡=K⊡+⊡4 and K5⊡=K⊡+⊡5. As we have seen, K4⊡ and K5⊡ are not the transitive ⊡-logic and Euclidean ⊡-logic, respectively. It is then natural to ask which logics both proof systems are; in other words, which classes of frames are characterized by K4⊡ and K5⊡, respectively.
We remind the reader of the properties qt, pt, qe, pe at the beginning of Sec. 7.2. It is not hard to see that pt is stronger than qt, and pe is stronger than qe, thus every pt-frame/model is a qt-frame/model, and every pe-frame/model is a qe-frame/model. We use Γ⊨qtφ to mean that φ is a semantical consequence of Γ over the class of qt-frames, that is, for every qt-model M and every state s in M, if M,s⊨ψ for all ψ∈Γ, then M,s⊨φ. Similar meanings goes to Γ⊨ptφ, Γ⊨qeφ, and Γ⊨peφ. We will show that K4⊡ is sound and strongly complete with respect to both the class of qt-frames and the class of pt-frames, and K5⊡ is sound and strongly complete with respect to both the class of qe-frames and the class of pe-frames.
Before showing the soundness and strong completeness of K4⊡ and K5⊡, it is worth remarking that w⊡4 and w⊡5 are provable in K4⊡ and K5⊡, respectively, by letting ψ in ⊡4 and ⊡5 be ⊥.
To simplify the proofs below, we provide two useful results.
Proposition 58**.**
Define Mc w.r.t. K4⊡ as in Def. 28 and sRict for i∈{1,2}. If ⊡φ∈s, then ⊡φ∈t.
Proof.
Suppose that sRict for i∈{1,2} and ⊡φ∈s. Then there exists χ such that ¬⊡χ∈s and (∗) for all φ, if ⊡φ∧⊡(χ→φ)∈s, then φ∈t.
since ⊡φ∈s, by w⊡4, we have ⊡⊡φ∈s; by ⊡4, we obtain that ⊡(⊡φ∨¬χ)∈s, that is, ⊡(χ→⊡φ)∈s, then by (∗), it follows that ⊡φ∈t.
∎
Proposition 59**.**
Define Mc w.r.t. K5⊡ as in Def. 28 and sRict for i∈{1,2}. If ⊡φ∈t, then ⊡φ∈s.
Proof.
Suppose that sRict for i∈{1,2} and ¬⊡φ∈s. Then there exists χ such that ¬⊡χ∈s and (⋆) for all ψ, if ⊡ψ∧⊡(χ→ψ)∈s, then φ∈t.
since ¬⊡φ∈s, by w⊡5 it follows that ⊡¬⊡φ∈s; by ⊡5, it follows that ⊡(¬⊡φ∨¬χ)∈s, i.e. ⊡(χ→¬⊡φ)∈s. Then using (⋆), we derive that ¬⊡φ∈t.
∎
We are now ready to show the soundness and strong completeness of K4⊡ and K5⊡.
Theorem 60**.**
Let φ∈L(⊡). The following conditions are equivalent:
Γ⊢K4⊡φ
Γ⊨qtφ
Γ⊨ptφ.
Proof.
We show (a)⇒(b)⇒(c)⇒(a).
(a)⇒(b): By soundness of K⊡, it suffices to show that ⊡4 is valid on the class of qt-frames.
If not, there exists a qt-model M=⟨S,R1,R2,V⟩ and a state s∈S such that M,s⊨⊡φ but s⊭⊡(⊡φ∨ψ). Then for some t and u, it holds that sR1t and sR2u and t⊨⊡φ∨ψ⟺u⊨⊡φ∨ψ. W.l.o.g. we assume that t⊭⊡φ∨ψ and u⊨⊡φ∨ψ. From t⊭⊡φ∨ψ it follows that t⊭⊡φ, and thus there are v,w such that tR1v and tR2w and (v⊨φ⟺w⊨φ). By sR1t, tR1v, tR2w and the property (qt) of M, we have sR1v and sR2w, which together with the fact that s⊨⊡φ implies that (v⊨φ⟺w⊨φ): a contradiction.
(b)⇒(c): this is because every pt-model is a qt-model.
(c)⇒(a): Define Mc w.r.t. K4⊡ as in Def. 28. It is sufficient to show that Mc is a pt-model.
Suppose for i,j∈{1,2} that sRict and tRjcu. Then there exists χ such that ¬⊡χ∈s and (a) for all φ, if ⊡φ∧⊡(χ→φ)∈s, then φ∈t, and there is a ψ such that ¬⊡ψ∈t and (b) for all φ, if ⊡φ∧⊡(ψ→φ)∈t, then φ∈u. To show sR1cu and sR2cu, it suffices to demonstrate that for all φ, if ⊡φ∧⊡(χ→φ)∈s, then φ∈u. For this, let φ be arbitrary such that ⊡φ∧⊡(χ→φ)∈s. In what follows, we will show that ⊡φ∧⊡(ψ→φ)∈t, which by (b) implies that φ∈u.
⊡φ∈t: direct by sRict and ⊡φ∈s and Prop. 58.
⊡(ψ→φ)∈t: from ⊡(χ→φ)∈s (i.e. ⊡(¬φ→¬χ)∈s) and ¬⊡χ∈s (i.e. ⊡¬χ∈/s), it follows by axiom ⊡CON that ⊡(φ→¬χ)∈/s, namely ⊡(¬φ∨¬χ)∈/s. Thanks to ⊡φ∈s, by axiom ⊡DIS we infer that ⊡(φ∨¬ψ)∈s, that is, ⊡(ψ→φ)∈s. Then by Prop. 58 again, we conclude that ⊡(ψ→φ)∈t.
∎
Theorem 61**.**
Let φ∈L(⊡). The following conditions are equivalent:
Γ⊢K5⊡φ
Γ⊨qeφ
Γ⊨peφ.
Proof.
We show (a)⇒(b)⇒(c)⇒(a).
(a)⇒(b): by soundness of K⊡, it is sufficient to show that ⊡5 is valid on the class of qe-frames.
If not, there exists qe-model M=⟨S,R1,R2,V⟩ and state s∈S such that M,s⊨¬⊡φ but s⊭⊡(¬⊡φ∨ψ). From s⊨¬⊡φ, it follows that for some t,u such that sR1t and sR2u and t⊨φ⟺u⊨φ. From s⊭⊡(¬⊡φ∨ψ), it follows that for some v,w such that sR1v and sR2w and v⊨¬⊡φ∨ψ⟺w⊨¬⊡φ∨ψ. W.l.o.g. we assume that v⊨¬⊡φ∨ψ and w⊨⊡φ∧¬ψ. By sR2w and sR1t and sR2u and the property (qe) of M, we infer wR1t and wR2u. Due to w⊨⊡φ, we have t⊨φ⟺u⊨φ: a contradiction.
(b)⇒(c): This is due to the fact that every pe-model is a qe-model.
(c)⇒(a): Define Mc w.r.t. K5⊡ as in Def. 28. The remainder is to prove that Mc is a pe-model.
Suppose for i,j∈{1,2} that sRict and sRjcu. Then there exists χ such that ¬⊡χ∈s and (†) for all φ, if ⊡φ∧⊡(χ→φ)∈s, then φ∈t, and there is a ψ such that ¬⊡ψ∈s and (††) for all φ, if ⊡φ∧⊡(ψ→φ)∈s, then φ∈u. To show tR1cu and tR2cu, we need to find a δ such that ¬⊡δ∈t and for all φ, if ⊡φ∧⊡(δ→φ)∈t, then φ∈u. We show that χ is a desired δ.
¬⊡χ∈t: otherwise, by Prop. 59, we would derive ⊡χ∈s: a contradiction.
Assume for any φ such that ⊡φ∧⊡(χ→φ)∈t, we only need show that φ∈u. By assumption and Prop. 59, ⊡φ∧⊡(χ→φ)∈s. As ¬⊡χ∈s, ⊡¬χ∈/s; as ⊡(χ→φ)∈s, ⊡(¬φ→¬χ)∈s. Thus by axiom ⊡CON, it follows that ⊡(φ→¬χ)∈/s, viz. ⊡(¬φ∨¬χ)∈/s. From this and ⊡φ∈s and axiom ⊡DIS, we have ⊡(φ∨¬ψ)∈s, that is, ⊡(ψ→φ)∈s. Now applying (††), we get φ∈u, as desired.
∎
8 Conclusion and Future work
In this paper, we proposed the operator ⊡ for the generalized noncontingency and the operator ⊞ for pseudo noncontingency, which are obtained by slightly adapting two equivalent semantics of noncontingency operator. We showed that L(⊡) is less expressive than L(⊞) over five basic model classes. Besides, the two logics cannot define the five basic frame properties, with the aid of a notion of ⊡-morphisms. We then presented the minimal logic of L(⊞), which also characterizes the class of serial bimodal frames. Moreover, we axiomatized L(⊡) over various frame classes, among which the completeness of serial logic and of symmetric logic were shown via the notion of ⊡-morphisms.
There are a lot of future work to be continued. For instance, the axiomatizations of L(⊞) over the class of frames with other special properties, including reflexivity, transitivity, symmetry, Euclidicity; the axiomatizations of L(⊡) over the class of transitive frames and over the class of Euclidean frames.
Acknowledgements
This research is financially supported by the project 17CZX053 of National Social Science Fundation of China.