TheoremComplete

Completeness Theorem for the Basic Modal Logic K

The completeness theorem for K\mathbf{K} states that every K\mathbf{K}-consistent formula is satisfiable in a Kripke model. The proof uses the canonical model construction, which builds a universal Kripke model from maximally consistent sets.


Statement

Theorem8.1Completeness of K

For any modal formula Ο†\varphi: KβŠ’Ο†\mathbf{K} \vdash \varphi if and only if Ο†\varphi is valid in all Kripke frames (i.e., ⊨KΟ†\models_K \varphi). Equivalently, every K\mathbf{K}-consistent formula is satisfiable in some Kripke model.


Proof

Proof

Soundness (KβŠ’Ο†β€…β€ŠβŸΉβ€…β€ŠβŠ¨KΟ†\mathbf{K} \vdash \varphi \implies \models_K \varphi): All axioms of K\mathbf{K} are valid in all Kripke frames, and the rules (modus ponens, necessitation) preserve validity.

Completeness (⊨KΟ†β€…β€ŠβŸΉβ€…β€ŠKβŠ’Ο†\models_K \varphi \implies \mathbf{K} \vdash \varphi): We prove the contrapositive: if KβŠ’ΜΈΟ†\mathbf{K} \not\vdash \varphi, then ¬φ\neg \varphi is K\mathbf{K}-consistent, so {¬φ}\{\neg \varphi\} can be extended to a maximally K\mathbf{K}-consistent set w0w_0 (by Lindenbaum's lemma).

Construct the canonical model M=(W,R,V)\mathcal{M} = (W, R, V):

  • WW: all maximally K\mathbf{K}-consistent sets of formulas.
  • RR: wRvw R v iff {ψ:β–‘Οˆβˆˆw}βŠ†v\{\psi : \Box \psi \in w\} \subseteq v.
  • VV: V(p)={w∈W:p∈w}V(p) = \{w \in W : p \in w\}.

Truth Lemma: By induction on formula complexity, M,wβŠ¨Οˆβ€…β€ŠβŸΊβ€…β€ŠΟˆβˆˆw\mathcal{M}, w \models \psi \iff \psi \in w. The modal case: M,wβŠ¨β–‘Οˆβ€…β€ŠβŸΊβ€…β€Š\mathcal{M}, w \models \Box \psi \iff for all vv with wRvwRv, ψ∈vβ€…β€ŠβŸΊβ€…β€Šβ–‘Οˆβˆˆw\psi \in v \iff \Box \psi \in w. The right-to-left direction uses: if β–‘Οˆβˆˆw\Box \psi \in w and wRvwRv, then ψ∈v\psi \in v by definition of RR. The left-to-right direction uses: if β–‘Οˆβˆ‰w\Box \psi \notin w, construct vv with {Ο‡:β–‘Ο‡βˆˆw}βˆͺ{¬ψ}\{\chi : \Box \chi \in w\} \cup \{\neg \psi\} consistent, extend to maximal, giving wRvwRv and Οˆβˆ‰v\psi \notin v.

Since Β¬Ο†βˆˆw0\neg \varphi \in w_0, we have M,w0βŠ¨Β¬Ο†\mathcal{M}, w_0 \models \neg \varphi, so Ο†\varphi is not valid. β–‘\square

β– 
RemarkExtensions to Other Logics

The same canonical model technique proves completeness of T\mathbf{T}, K4\mathbf{K4}, S4\mathbf{S4}, and S5\mathbf{S5}, since the canonical models for these logics have the required frame properties (reflexive, transitive, etc.). However, some logics (like GL\mathbf{GL}) require different techniques since the canonical frame is not well-founded.