A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Possible Worlds Semantics

Research Depth 105 in the knowledge graph ☐ I know this ☆ Set as goal
82topics build on this
654prerequisites beneath it
See this on the map →
Modal Semantics: Necessity and PossibilityMontague Semantics+2 more→→Actualism and the Actuality ThesisCounterfactual Conditionals and Similarity+18 more
semantics modality possible-worlds

Core Idea

Possible worlds semantics interprets modal expressions by quantifying over alternative worlds: a statement is necessary if true in all possible worlds, contingent if true in some but not all. This framework provides truth conditions for modals, counterfactuals, and intensional contexts.

How It's Best Learned

Practice translating English modal sentences into possible worlds notation; study accessibility relations between worlds to formalize different modal systems (K, S4, S5).

Common Misconceptions

Possible worlds are abstract models, not metaphysical entities; the framework is a mathematical tool for reasoning about modality, not a claim about hidden universes.

Explainer

From your work in Montague semantics, you know that sentence meaning can be modeled as functions from contexts to truth values, and from modal semantics you know that words like "must," "might," "necessarily," and "possibly" resist simple truth-functional analysis — their truth depends not just on what is actually the case but on what could or must be the case. Possible worlds semantics provides the formal machinery that makes modal semantics precise. The core idea is elegant: treat "possible world" as a primitive — an abstract index representing a complete way the world could be — and evaluate modal sentences by quantifying over these indices.

The key definitions fall out immediately. A proposition is necessarily true if it is true in every possible world accessible from the world of evaluation. It is possibly true if it is true in at least one accessible world. "Accessible from" is doing critical technical work here: not every world is relevant for every modal claim. The accessibility relation R between worlds is what distinguishes modal systems. In system K, R is unrestricted. In S4, R is reflexive and transitive (any world accessible from an accessible world is itself accessible). In S5, R is an equivalence relation, meaning all worlds access all worlds — the most permissive and philosophically controversial system. Which system is correct depends on what kind of modality you are modeling: epistemic necessity (what an agent must believe given their knowledge) uses different accessibility than metaphysical necessity (what could not fail to be true).

Counterfactuals — "If it had rained, the match would have been cancelled" — are one of the framework's most powerful applications. The problem is that the antecedent is false in the actual world, which makes simple material implication vacuously true for all counterfactuals. David Lewis's solution is to evaluate counterfactuals by looking at the closest possible worlds where the antecedent holds — the worlds that are most similar to the actual world except for the relevant change — and checking whether the consequent holds there. This gives non-trivial truth conditions that match our intuitions about when counterfactuals are true.

A persistent misconception — important enough that it appears in the Core Idea — is that possible worlds semantics makes claims about the physical existence of alternative universes. It does not. Possible worlds are abstract indices in a formal model, no different in status from the numbers used in arithmetic. You can use the framework without any commitment about whether non-actual worlds "really exist" in any deep sense. The metaphysics of possible worlds (realism vs. ersatzism vs. fictionalism) is a separate philosophical debate; the semantics works the same way regardless of which metaphysical view you hold.

When you work with this framework, the practical skill is translating between English modal sentences and their formal representations. "It must be raining" becomes □P (box P: P is true at all accessible worlds). "It might be raining" becomes ◇P (diamond P: P is true at some accessible world). Intensional contexts — belief reports, attitude verbs, temporal operators — all become amenable to possible worlds treatment, which is why Montague's program depends on this foundation. The unifying power of the framework is what makes it central to formal semantics.

Practice Questions 3 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → Modal Semantics: Necessity and Possibility → Intensionality and Possible Worlds Semantics → Event Semantics → Aktionsart (Lexical Aspect) → Tense and Aspect in Formal Semantics → Viewpoint Aspect (Perfective and Imperfective) → Formal Semantics of Tense and Time → Formal Semantics of Modality and Possibility → Possible Worlds Semantics

Longest path: 106 steps · 654 total prerequisite topics

Prerequisites (4)

Leads To (20)