Skip to content

Kripke Frame

Defines Kripke Frame, frame

Let WW be a nonempty set.

Definition. A Kripke frame is a pair F=(W,R)\mathcal{F} = (W, R), where WW is a set of possible worlds and RW×WR \subseteq W \times W is an accessibility relation on WW.

A frame carries no information about which propositions hold at which worlds. Adding a valuation V ⁣:PropP(W)V \colon \mathrm{Prop} \to \mathcal{P}(W) yields a Kripke model (W,R,V)(W, R, V).

Definition. A modal formula φ\varphi is valid on the frame F\mathcal{F}, written Fφ\mathcal{F} \models \varphi, if for every valuation VV and every wWw \in W, (W,R,V),wφ(W, R, V), w \models \varphi.

Proposition (Frame correspondence). A frame (W,R)(W, R) validates φφ\Box\varphi \to \varphi for all φ\varphi if and only if RR is reflexive. It validates φφ\Box\varphi \to \Box\Box\varphi for all φ\varphi if and only if RR is transitive.

Proof sketch. The forward directions are direct semantic arguments. The reverse directions use the freedom to choose a valuation VV that isolates the required structural property of RR. \square

Proposition (Complex algebra). The complex algebra of F\mathcal{F} is the Boolean algebra P(W)\mathcal{P}(W) equipped with the operator R ⁣:P(W)P(W)\Box_R \colon \mathcal{P}(W) \to \mathcal{P}(W) defined by R(S)={wW:v(wRvvS)}\Box_R(S) = \{w \in W : \forall v\, (wRv \Rightarrow v \in S)\}. This is a modal algebra, and the map F(P(W),R)\mathcal{F} \mapsto (\mathcal{P}(W), \Box_R) embeds frames into modal algebras.

Proof sketch. R\Box_R preserves finite meets and sends WW to WW, so (P(W),R)(\mathcal{P}(W), \Box_R) is a normal modal algebra. \square

Examples.

  • (W,W×W)(W, W \times W): every world accesses every other. Validates S5. The complex algebra collapses R(S)\Box_R(S) to either \emptyset or WW.
  • (W,)(W, \leq) for a partial order \leq: validates S4. When WW is finite and \leq is a tree, these are the frames for intuitionistic propositional logic.
  • The standard modal systems K, T, S4, S5 are each sound and complete for the class of all frames, reflexive frames, preorders, and equivalence relations, respectively.

Algebraically, when RR is a preorder, the upward-closed subsets of (W,R)(W, R) form a Heyting algebra, connecting Kripke semantics to algebraic semantics.

Relations

Date created
Mathematical object
Set

Cite

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