A Guided Tour of Possible Worlds: Understanding Kripke Semantics for Modal Logic

Kripke semantics, also known as possible worlds semantics, is a formal framework developed by Saul Kripke to provide a clear truth-conditional analysis for modal logic. It addresses the logic of necessity (□) and possibility (◇) by moving beyond a single, actual state of affairs. The core idea is that a statement's modal status is evaluated across a set of 'possible worlds,' which are complete and consistent alternative scenarios. A formal Kripke model consists of a set of worlds (W), an accessibility relation (R) that defines which worlds are considered possible alternatives from any given world, and a valuation function (V) that specifies which basic propositions are true in each world. Within this model, a proposition is 'necessarily true' at a world `w` if it is true in every world accessible from `w`. It is 'possibly true' if it is true in at least one world accessible from `w`. The true versatility of Kripke semantics comes from the accessibility relation, `R`. By imposing different mathematical properties on `R`—such as reflexivity, symmetry, or transitivity—we can validate different modal axioms and thereby define distinct logical systems (like K, T, S4, and S5). This allows the framework to model a wide range of concepts, from logical necessity and knowledge (epistemic logic) to moral obligation (deontic logic) and the passage of time (temporal logic), making it a foundational tool in modern philosophy, computer science, and linguistics.

1. Introduction: Beyond True and False

Standard propositional and predicate logic are powerful tools for reasoning about what is true or false. However, they lack the vocabulary to discuss what could be true, what must be true, or what we know or believe to be true. This is the domain of modal logic.

Modal logic extends classical logic with two new operators:

• □ (Box): Represents necessity. □p can be read as "It is necessary that p."
• ◇ (Diamond): Represents possibility. ◇p can be read as "It is possible that p."

For centuries, these concepts were debated philosophically without a formal, mathematical way to determine the truth of modal statements. The breakthrough came in the mid-20th century with the work of Saul Kripke, who introduced a simple yet profound framework known as Kripke semantics, or more intuitively, possible worlds semantics.

2. The Core Idea: Possible Worlds

Imagine that our current reality is just one "world" among many. A possible world is a complete and consistent state of affairs. In one possible world, you are reading this text. In another, you decided to go for a walk instead. In yet another, unicorns exist and gravity is slightly weaker.

Kripke's insight was to define the truth of modal statements relative to these worlds:

• A statement is necessarily true (□p) in our world if it is true in every possible world we can conceive of from our current one.
• A statement is possibly true (◇p) in our world if it is true in at least one possible world we can conceive of from our current one.

This framework allows us to move from vague philosophical notions to a concrete model we can use for formal proofs.

3. The Formal Machinery: Kripke Models

A Kripke Model M is the formal structure that captures the possible worlds idea. It is a triple: M = <W, R, V>

1. W (Worlds): A non-empty set of elements we call "possible worlds." Let's say W = {w1, w2, w3}.

1. R (Accessibility Relation): A binary relation on W. R tells us which worlds are "accessible" from others. If w1 R w2, it means that from the perspective of w1, w2 is a possible alternative. This relation is the most powerful component of the model. It doesn't have to be that every world is accessible from every other world.

1. V (Valuation Function): A function that assigns a truth value (True or False) to every atomic proposition (like p, q, r) in every world in W. For example, V(p, w1) = True means "The proposition p is true in world w1," while V(p, w2) = False means "p is false in world w2."

4. Defining Truth in a Model

We use the notation M, w ⊨ φ to mean "The formula φ is true at world w in model M."

• Atomic Propositions: M, w ⊨ p if and only if V(p, w) = True.
• Logical Connectives: These work just as they do in classical logic (e.g., M, w ⊨ φ ∧ ψ iff M, w ⊨ φ and M, w ⊨ ψ).
• The Modal Operators (The Crucial Part):

Necessity (□): M, w ⊨ □φ if and only if for every world w' such that w R w', it is the case that M, w' ⊨ φ. Possibility (◇): M, w ⊨ ◇φ if and only if there exists at least one world w' such that w R w', for which M, w' ⊨ φ.

Example Walkthrough:

Let's create a simple model M = <W, R, V>:

• W = {w1, w2, w3}
• R = {(w1, w2), (w1, w3), (w2, w2), (w3, w2)} (This means w2 and w3 are accessible from w1; w2 is accessible from itself; and w2 is accessible from w3.)
• V(p, w1) = False, V(p, w2) = True, V(p, w3) = False.

Let's evaluate some formulas at world w1:

1. Is ◇p true at w1? (M, w1 ⊨ ◇p?)

We need to check if there is any world accessible from w1 where p is true. The worlds accessible from w1 are w2 and w3. At w2, p is true (V(p, w2) = True). Since we found at least one such world, Yes, ◇p is true at w1.

1. Is □p true at w1? (M, w1 ⊨ □p?)

We need to check if p is true in every world accessible from w1. The worlds accessible from w1 are w2 and w3. At w2, p is true. So far, so good. At w3, p is false (V(p, w3) = False). * Since p is not true in all accessible worlds, No, □p is false at w1.

5. The Power of the Accessibility Relation

The true genius of Kripke semantics lies in the flexibility of the accessibility relation R. By placing different constraints on R, we can model different kinds of necessity and possibility, which correspond to different systems of modal logic.

• System K: The basic system with no constraints on R.

• Reflexivity (For all w, w R w): If a relation is reflexive, it means every world can "see" itself. This corresponds to the axiom (T): □p → p. If a proposition is necessarily true, then it must be true in the current world. This makes sense for epistemic logic (logic of knowledge): If you know that p, then p must be true.

• Symmetry (If w1 R w2, then w2 R w1): If w2 is a possible alternative to w1, then w1 must be a possible alternative to w2. This corresponds to the axiom (B): p → □◇p. If p is true now, it is necessary that p was possible.

• Transitivity (If w1 R w2 and w2 R w3, then w1 R w3): This corresponds to the axiom (4): □p → □□p. If it is necessary that p, then it is necessarily necessary that p. This makes sense for logical necessity. If a theorem is necessarily true, the fact of its necessity is also a necessary truth.

• Seriality (For all w, there exists a w' such that w R w'): No world is a "dead end." This corresponds to axiom (D): □p → ◇p. If something is necessary, it must be possible. This is fundamental to deontic logic (logic of obligation): If you ought to do p, it must be permissible (possible) to do p.

Different combinations of these properties define famous modal systems:

• T: Reflexive
• S4: Reflexive and Transitive
• S5: Reflexive, Symmetric, and Transitive (an equivalence relation)

Browse public study notes