Completeness Theorem for the Basic Modal Logic K
The completeness theorem for states that every -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
For any modal formula : if and only if is valid in all Kripke frames (i.e., ). Equivalently, every -consistent formula is satisfiable in some Kripke model.
Proof
Soundness (): All axioms of are valid in all Kripke frames, and the rules (modus ponens, necessitation) preserve validity.
Completeness (): We prove the contrapositive: if , then is -consistent, so can be extended to a maximally -consistent set (by Lindenbaum's lemma).
Construct the canonical model :
- : all maximally -consistent sets of formulas.
- : iff .
- : .
Truth Lemma: By induction on formula complexity, . The modal case: for all with , . The right-to-left direction uses: if and , then by definition of . The left-to-right direction uses: if , construct with consistent, extend to maximal, giving and .
Since , we have , so is not valid.
The same canonical model technique proves completeness of , , , and , since the canonical models for these logics have the required frame properties (reflexive, transitive, etc.). However, some logics (like ) require different techniques since the canonical frame is not well-founded.