Skip to content

Kripke Model

Defines Kripke Model

Let F=(W,R)\mathcal{F} = (W, R) be a Kripke frame.

Definition. A Kripke model on F\mathcal{F} is a triple M=(W,R,V)M = (W, R, V), where V ⁣:PropP(W)V \colon \mathrm{Prop} \to \mathcal{P}(W) is a valuation assigning to each atomic proposition pp the set of worlds at which pp is true.

Definition. The satisfaction relation M,wφM, w \models \varphi (read “φ\varphi is true at ww in MM”) is defined recursively on modal formulas:

  • M,wpM, w \models p iff wV(p)w \in V(p).
  • M,wφψM, w \models \varphi \wedge \psi iff M,wφM, w \models \varphi and M,wψM, w \models \psi.
  • M,wφψM, w \models \varphi \vee \psi iff M,wφM, w \models \varphi or M,wψM, w \models \psi.
  • M,w¬φM, w \models \neg\varphi iff M,w⊭φM, w \not\models \varphi.
  • M,wφψM, w \models \varphi \to \psi iff M,w⊭φM, w \not\models \varphi or M,wψM, w \models \psi.
  • M,wφM, w \models \Box\varphi iff for all vv with wRvwRv, M,vφM, v \models \varphi. (Necessity requires truth at all accessible worlds.)
  • M,wφM, w \models \Diamond\varphi iff there exists vv with wRvwRv such that M,vφM, v \models \varphi. (Possibility requires truth at some accessible world.)

A formula φ\varphi is satisfiable if M,wφM, w \models \varphi for some MM and some ww. It is valid if M,wφM, w \models \varphi for every MM and every ww.

Proposition. For each modal system Λ\Lambda and its corresponding class of frames C\mathcal{C}, a formula is a theorem of Λ\Lambda if and only if it is valid on every frame in C\mathcal{C}.

Proof sketch. Soundness follows by induction on derivations. Completeness is proved by the canonical model construction: take WW to be the set of maximal Λ\Lambda-consistent sets, define RR and VV canonically, and verify the truth lemma by induction on formula complexity. \square

Proposition (Intuitionistic Kripke models). For intuitionistic logic, a Kripke model is a triple (W,,V)(W, \leq, V) where \leq is a partial order and VV satisfies the persistence condition: if wV(p)w \in V(p) and wvw \leq v, then vV(p)v \in V(p). The satisfaction clause for \to becomes: M,wφψM, w \models \varphi \to \psi iff for all vwv \geq w, M,vφM, v \models \varphi implies M,vψM, v \models \psi.

Examples.

  • A single reflexive world with V(p)={w}V(p) = \{w\}: the model collapses to classical propositional logic, with φφ\Box\varphi \leftrightarrow \varphi.
  • W={w0,w1}W = \{w_0, w_1\}, R={(w0,w1)}R = \{(w_0, w_1)\}, V(p)={w1}V(p) = \{w_1\}: then M,w0pM, w_0 \models \Diamond p but M,w0⊭pM, w_0 \not\models p.
  • The canonical model of S5 has WW the set of all maximal consistent sets and R=W×WR = W \times W.

Relations

Date created
Defines
Mathematical object
Kripke frame

Cite

@misc{emsenn2025-kripke-model,
  author    = {emsenn},
  title     = {Kripke Model},
  year      = {2025},
  url       = {https://emsenn.net/library/math/domains/logic/terms/kripke-model/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}