11 Metatheory

We have explored a landscape of normal modal systems characterizing different classes of frames. We now outline a method for the justification of the fact that a normal modal system Σ characterizes a class of frames C by which, we mean, as usual that for all modal formulas, Σφif, and only if,Cφ That is, Σ proves all (Completeness) and only (Soundness) formulas, which are valid in all frames in C. One direction (Soundness) requires one to verify that the axioms of Σ are valid in all frames in C, and that the rules of inference of Σ preserve validity in all frames in C.

We will now focus on the other direction (Completeness), which we approach by contraposition: if φ is not a theorem of Σ, then φ is not valid in every frame in C. That is, we will build a special model based on a frame (W,R) in C in which the formula φ fails. The model in question will be what is known as the canonical model for the system Σ, and the main task will often be to verify that the canonical model for Σ is based on a frame in C.

Canonical Models

First, some preliminary definitions.

Definition 11.1 (Derivability) A modal formula φ is Σ-derivable from Γ, written ΓΣφ, if, and only if, there is a finite conjunction α of formulas α1,,αnΓ for which: Σαφ

Notice that this is not quite how we defined derivability in propositional logic since we make no allowance for premises in a derivation. To allow for premises would lead to undesirable results in the presence of the rule of necessitation.

Definition 11.2 (Consistency) A set of modal formulas Γ is Σ-consistent if, and only if, ΓΣ. That is, there is no finite conjunction α of formulas α1,,αnΓ for which: Σα Otherwise, we call Γ, Σ-inconsistent. We will write that a modal formula φ is Σ-consistent if its singleton set {φ} is Σ-consistent, that is, if Σφ.

We will exploit the fact that Σ-consistent sets of modal formulas have a number of helpful features we record now.

Proposition 11.1 For all modal formulas φ in L, ΓΣφif, and only if,Γ,¬φ is Σ-inconsistent.

Proof. We look at each direction in turn.

() If ΓΣφ, then Γ,¬φΣφ. Since Σ(α¬φ)¬φ, we have Σ(α¬φ). So, Γ,¬φ is Σ-inconsistent.

() If Γ,{¬φ} Σ-inconsistent, for some conjunction α of members of Γ, we have Σα¬φ. Since Σ¬, we have that Σαφ and ΓΣφ.

Definition 11.3 (Maximal Consistency) A set of modal formulas Γ is maximal Σ-consistent if, and only if,

  1. Γ is Σ-consistent, and
  2. for each modal formula φ, if Γ,φ is Σ-consistent, then φΓ.

Maximal Σ-consistent sets satisfy a variety of helpful decomposition principles.

Lemma 11.1 If Σ is a normal modal system and Γ is a maximal Σ-consistent set of modal formulas, then: 1.ΓΣφiffφΓ2.¬φΓiffφΓ3.φψΓiffφΓ or ψΓ

Proof. We look at each claim in turn.

  1. There are two directions.

    () If ΓΣφ, then Γ,¬φ is Σ-inconsistent. On the other hand, if φΓ, then, by definition of maximal Σ-consistency, Γ,φ would be Σ-inconsistent making Γ Σ-inconsistent. So, φΓ.

    () If φΓ, then ΓΣφ since Σφφ.

  2. We look at each direction in turn.

    () If ¬φΓ, then ΓΣ¬φ. So, if Γ is Σ-consistent, then φΓ.

    () If φΓ, then Γ,φ is Σ-inconsistent. So, Γ,¬¬φ is Σ-inconsistent, and by Proposition 5.1 ΓΣ¬φ.

  3. The proof of part 3 is analogous.

Definition 11.4 Given two maximal Σ-consistent sets of modal formulas Γ and Δ, we write ΓRΔ iff for each modal formula φ in Δ, φ is in Γ. Or, in other words, ΓRΔ iff {φ:φΔ}Γ.

We will often make use of an alternative characterization of the relation just now introduced for a canonical model.

Lemma 11.2 For all maximal Σ-consistent sets Γ,Δ, {φ:φΔ}Γiff{φ:φΓ}Δ

Proof. () Suppose {φ:φΔ}Γ. Suppose now that φΓ. For a reductio, suppose φΔ. In that case, ¬φΔ, which means, by assumption, that ¬φΓ. Since is ¬¬, we have that ¬¬¬φΓ. Since Σ¬¬¬φ¬φ, we have ¬φΓ and φΓ, which completes the reductio.

() Suppose {φ:φΓ}Δ. We argue for the contrapositive: if φΓ, then φΔ. Suppose that φΓ. Since is ¬¬, we have that ¬¬φΓ. By maximal Σ-consistency of Γ, ¬φΓ, which, by assumption, requires ¬φΔ. It follows that φΔ.

Lemma 11.3 If Σ is a normal modal system and Γ is a maximal Σ-consistent set of modal formulas, then: 3.φΓifffor some Δ, ΓRΔ and φΔ

Proof. We distinguish two directions:

() Consider the set of modal formulas {φ}{ψ:ψΓ} Notice that if Δ is a maximal Σ-consistent, which includes that union as a subset, then ΓRΔ, and we would be done.

We now argue that the set given above is Σ-consistent.

Suppose not. Then there is a conjunction ψ1ψn of modal formulas with ψ1,,ψnΓ such that Σφ(ψ1ψn) Thus: Σ(ψ1ψn)¬φ Since Σ is a normal modal system, we have: Σψ1ψn¬φ Since Γ is maximal Σ-consistent, it contains every theorem of Σ. Therefore: (ψ1ψn)¬φΓ Because ψ1ψnΓ, by lemma 5.1, we infer: (ψ1ψn)Γ ¬φΓ But since abbreviates ¬¬, ¬φ is equivalent to ¬φ, and given the Σ-consistency of Γ, we have thereby contradicted the assumption that φΓ. We conclude that the set {φ}{ψ:ψΓ} is Σ-consistent and can be extended to a maximal Σ-consistent set Δ. It follows that ΓRΔ and φΔ.

() This direction is trivial once we unpack the definition of ΓRΔ.

We will now exploit the features of maximal Σ-consistent sets of modal formulas to define the canonical model for a modal system Σ.

Definition 11.5 (Canonical Model) The canonical model MΣ for a modal system Σ is a model of the form (WΣ,RΣ,VΣ), where:

  • WΣ consists of all maximal Σ-consistent sets of modal formulas,

  • for all maximal Σ-consistent sets Γ,Δ,

    ΓRΣΔ if, and only if, {φ:φΔ}Γ. That is, φΓ whenever φΔ.

  • for each propositional variable p,

    VΣ(p)={ΓWΣ:pΓ}.

The interest of canonical models is that they are governed by the truth lemma according to which a world in the canonical model for Σ verifies a modal formula φ if, and only if, that very formula is a member of the world conceived as a maximal Σ-consistent set of modal formulas.

Lemma 11.4 (Truth Lemma) For each maximal Σ-consistent set of modal formulas Γ, (WΣ,RΣ,VΣ),ΓφiffφΓ

The justification for the truth lemma is an induction of the complexity of modal formulas.

We use an induction on the complexity of φ to establish:
(WΣ,RΣ,VΣ),ΓφiffφΓ.
- Base Case:

(WΣ,RΣ,VΣ),ΓpiffΓVΣ(p)iffpΣ.definition of VΣ
- Inductive Step for ¬:

(WΣ,RΣ,VΣ),Γ¬φiff(WΣ,RΣ,VΣ),ΓφiffφΓInductive Hypothesisiff¬φΓLemma 5.1, 2
- Inductive Step for :

(WΣ,RΣ,VΣ),Γφψiff(WΣ,RΣ,VΣ),Γφ or (WΣ,RΣ,VΣ),ΓψiffφΓ or ψΓInductive HypothesisiffφψΓLemma 5.1, 3

  • Inductive Step for :

(WΣ,RΣ,VΣ),Γφiff(WΣ,RΣ,VΣ),Δφ whenever ΓRΣΔiffφΔ whenever ΓRΣΔInductive HypothesisiffφΓLemmas 5.2 and 5.4
We conclude that V verifies exactly those formulas in Σ. So, it follows that Σ is satisfiable.

Completeness

We are finally in a position to prove the completeness theorem for K.

Theorem 11.1 (Completeness Theorem for K) For each modal formulas φ, if φ, then Kφ. That is, if φ is valid in every frame, then φ is a theorem of K.

Proof. We argue by contraposition. Suppose a modal formula φ is not a theorem of K. Then its negation ¬φ will be K-consistent. That means that we may use Lindenbaum’s lemma to extend {¬φ} to a maximal K-consistent set Γ. Now, note that Γ is one of the worlds of the canonical model for K, (WK,RK,VK), and, by the Truth Lemma, we know that ¬φ will be true at Γ in the canonical model for K. Therefore, φ fails at a world in the canonical model for K. We conclude that φ is not valid in every frame.

There are further completeness theorems for the normal modal systems in the landscape we have considered. One example is the observation, for example, that a modal formula φ is a theorem of KT if refφ. That is, if a formula φ is valid in every reflexive frame, then φ is a theorem of KT.

We argue for the contrapositive. Suppose a modal formula φ is not a theorem of KT. Then its negation ¬φ will be KT-consistent. We will argue that ¬φ is true at a world of the canonical model for KT. That will mean that φ is false at a world of the canonical model for KT. Recall that we want to establish the completeness of KT with respect to the class of reflexive frames, which means that we should verify that φ fails at some world of some reflexive model. Our observation that φ fails at the canonical model for KT will suffice to that purpose only if the canonical model for KT is reflexive.

To complete the proof, we must verify that the canonical frame for KT is reflexive: for all maximal KT-consistent sets of modal formulas Γ, ΓRKTΓ. That will establish that φ is not valid in every reflexive frame, e.g., φ is not valid in the canonical frame for KT, which is reflexive.

Theorem 11.2 (Completeness Theorem for KT) For each modal formulas φ, if refφ, then Kφ. That is, if φ is valid in every reflexive frame, then φ is a theorem of KT.

Proof. We know that if φ is not a theorem of KT, then φ is not valid in the canonical frame for KT.

We proceed to verify that the canonical frame for KT is reflexive:

  • for all ΓWKT, ΓRKTΓ.

Given how we defined RKT, this is tantamount to the claim:

  • if φΓ, then φΓ.

But since KTφφ, it follows that φφΓ and since Γ is closed under KT-derivability, if Γφ, then φΓ. So, if φΓ, then Γφ and φΓ.

In order to facilitate the proof of completeness theorems for further normal modal systems, we will argue that there is a correlation between the derivability of all substitution instances of certain axioms and certain features of the accessibility relation for the canonical model for a modal system.

Proposition 11.2 The canonical model for a normal modal system Σ satisfies each condition listed below if it includes as axioms all substitution instances of the corresponding axiom.

Axiom Condition on RΣ
D pp serial on WΣ
T pp reflexive on WΣ
B pp symmetric on WΣ
4 pp transitive on WΣ
5 pp euclidean on WΣ

Proof. We unpack the argument for each axiom.

  • D / RΣ is serial on WΣ

    Suppose Σ proves every substitution instance of the formula pp. We proceed to verify that the canonical frame for Σ is serial:

    • for all ΓWΣ there is some ΔWΣ such that ΓRΣΔ.

    This is tantamount to the claim:

    • {φ:φΓ}Δ for some ΔWΣ.

    It will suffice to prove that {φ:φΓ} is Σ-consistent.

    Suppose not. Then there is a conjunction φ1φn of modal formulas with φ1,,φnΓ such that Σ(φ1φn) Since Σ is a normal modal system, we have: Σ(φ1φn) Since Γ is maximal Σ-consistent, it contains every theorem of Σ. Therefore: (φ1φn)Γ Because φ1φnΓ, by lemma 5.1, we infer: (φ1φn)Γ Γ But since Σ, Γ. Unfortunately, since Σ¬, ¬Γ, which would make Γ Σ-inconsistent. We conclude that the original set is Σ-consistent and can be extended to a maximal Σ-consistent set.

  • B / RΣ is symmetric on WΣ

    Suppose Σ proves every substitution instance of the formula pp. We proceed to verify that the canonical frame for Σ is symmetric:

    • for all Γ,ΔWΣ, if ΓRΣΔ, then ΔRΣΓ.

    This is tantamount to the claim:

    • if {φ:φΓ}Δ, then {φ:φΓ}Δ.

    To prove that conditional, assume the antecedent for arbitrary Γ,Δ: {φ:φΓ}Δ. We want to establish the consequent: if φΓ, then φΔ. Let φΓ. Since ΓΣφφ, we find that φΓ. So, since ΓRΣΔ, it follows that φΔ as desired.

  • 4 / RΣ is transitive on WΣ

    Suppose Σ proves every substitution instance of the formula pp. We proceed to verify that the canonical frame for Σ is euclidean:

    • for all Γ,Δ,ΘWΣ, ΓRΣΔ and ΔRΣΘ, then ΓRΣΘ.

    This is tantamount to the claim:

    • if {φ:φΓ}Δ and {φ:φΔ}Θ, then {φ:φΓ}Δ.

    To prove that conditional, assume the antecedent for arbitrary Γ,Δ,Θ: {φ:φΓ}Δ and {φ:φΔ}Θ. We want to establish the consequent: if φΓ, then φΘ.

    If φΓ, then since Σφφ and φφΓ, it follows that φΓ. Since ΓRΣΔ, it follows that φΔ, and since ΔRΣΘ, we conclude that φΘ as desired.

  • 5 / RΣ is euclidean on WΣ

    Suppose Σ proves every substitution instance of the formula pp. We proceed to verify that the canonical frame for Σ is euclidean:

    • for all Γ,Δ,ΘWΣ, ΓRΣΔ and ΓRΣΘ, then ΔRΣΘ.

    This is tantamount to the claim:

    • if {φ:φΓ}Δ and {φ:φΘ}Γ, then {φ:φΘ}Δ.

    To prove that conditional, assume the antecedent for arbitrary Γ,Δ,Θ: {φ:φΓ}Δ and {φ:φΘ}Γ. We want to establish the consequent: if φΘ, then φΔ. Let φΘ. Since ΓRΣΘ, φΓ. Since ΓΣφφ, we find that φΓ. So, since ΓRΣΔ, it follows that φΔ as desired.