Definition
Kripke semantics, also known as possible‑worlds semantics or relational semantics, is a formal framework for interpreting modal and related non‑classical logics. In this approach, the truth of statements involving modal operators (such as necessity ◻ and possibility ◇) is evaluated relative to possible worlds and an accessibility relation that connects those worlds.
Historical Background
The semantics was introduced by the American logician Saul A. Kripke in the early 1960s, most prominently in his 1963 paper “Semantical Considerations on Modal Logic.” Kripke’s work built on earlier philosophical concepts of possible worlds and provided a rigorous mathematical model that enabled completeness proofs for a range of modal systems.
Technical Components
| Component | Description |
|---|---|
| Worlds (W) | A non‑empty set of abstract entities, each representing a complete way the world might be. |
| Accessibility Relation (R) | A binary relation R ⊆ W × W. For worlds w and v, w R v means that v is considered a world accessible from w (e.g., a world that could be possible given the circumstances at w). |
| Valuation (V) | A function assigning to each propositional variable p the set of worlds in which p is true: V(p) ⊆ W. |
| Model (M) | A triple M = (W, R, V). A model together with a distinguished world w is denoted (M, w). |
Truth conditions for the basic modal language are defined inductively:
- Atomic propositions: (M, w) ⊨ p iff w ∈ V(p).
- Negation: (M, w) ⊨ ¬φ iff not (M, w) ⊨ φ.
- Conjunction: (M, w) ⊨ φ ∧ ψ iff (M, w) ⊨ φ and (M, w) ⊨ ψ.
- Necessity (□): (M, w) ⊨ □φ iff for every v ∈ W with w R v, (M, v) ⊨ φ.
- Possibility (◇): (M, w) ⊨ ◇φ iff there exists v ∈ W with w R v such that (M, v) ⊨ φ.
These clauses extend in a straightforward manner to richer languages (e.g., first‑order modal logic) by adding quantifiers and appropriate domain conditions for each world.
Modal Systems and Frame Conditions
Different modal logics correspond to restrictions on the accessibility relation:
- K – no constraints on R (the minimal normal modal logic).
- T – R is reflexive (□φ → φ).
- S4 – R is reflexive and transitive (adds □φ → □□φ).
- S5 – R is an equivalence relation (reflexive, symmetric, transitive), rendering all worlds mutually accessible.
Completeness theorems show that each of these logics is sound and complete with respect to the class of frames satisfying the corresponding relational property.
Applications
- Philosophical Logic: Formal analysis of necessity, possibility, knowledge, belief, and counterfactuals.
- Computer Science: Model checking, verification of concurrent systems, and description logics for knowledge representation.
- Linguistics: Semantics of modal expressions and tension between possible‑worlds and situation‑based approaches.
- Artificial Intelligence: Reasoning about agents’ epistemic states and planning under uncertainty.
Related Concepts
- Possible‑worlds semantics – the broader family of semantics that includes Kripke’s relational version.
- Hybrid logic – extends Kripke semantics with additional syntactic tools (nominals, satisfaction operators) to refer directly to worlds.
- Algebraic semantics – uses Boolean algebras with operators as an alternative to relational models.
References (selected)
- Kripke, S. A. (1963). Semantical Considerations on Modal Logic. Acta Philosophica Fennica 16: 83–94.
- Blackburn, P., de Rijke, M., & Venema, Y. (2001). Modal Logic. Cambridge University Press.
- Halpern, J. Y. (2003). Reasoning about Uncertainty. MIT Press (Chapter on modal logics and Kripke models).
See also
Possible world, Modal logic, Accessibility relation, Completeness theorem (modal logic), Model checking.