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

Modal Semantics and Possible Worlds

Research Depth 113 in the knowledge graph ☐ I know this ☆ Set as goal
27topics build on this
751prerequisites beneath it
See this on the map →
Introduction to Modal LogicPossible Worlds Semantics+2 more→→Counterfactual Conditionals and SimilarityCounterfactual Truth Conditions and Modal Metaphysics+5 more
modality possible-worlds necessity semantics

Core Idea

Modal sentences involving necessity and possibility are analyzed using possible worlds: a sentence is necessarily true iff true at all possible worlds; possibly true iff true at some accessible world. This extends truth-conditional semantics to modal discourse by adding a dimension of possible alternatives.

How It's Best Learned

Understand accessibility relations and how different modal logics (K, S4, S5) correspond to different properties of accessibility. Work through simple modal sentences and their truth conditions across worlds.

Explainer

Modal language — "necessarily," "possibly," "could have been," "must" — is pervasive but semantically opaque without a framework. What does it even mean to say something is necessary? From your study of possible worlds semantics and modal logic, you know the fundamental setup: a possible world is a complete way reality could be or could have been. The actual world is one possible world — the way things are. Other worlds are the ways things might have been. Modal semantics cashes out necessity and possibility as quantification over these worlds.

The core semantic clauses are elegant. A sentence is necessarily true if and only if it is true at every possible world accessible from the world of evaluation. It is possibly true if and only if it is true at some accessible world. The notion of an accessibility relation is what differentiates modal logics. If every world accesses every other, we get S5 — the logic typically used for metaphysical modality, where what's necessarily true is so in all worlds without restriction. If accessibility is reflexive but not symmetric (every world accesses itself, but not necessarily every other), we get different systems. Your modal logic background lets you see that formal axioms correspond to properties of accessibility: the T axiom ("if necessarily p, then p") corresponds to reflexivity — every world accesses itself, so what's necessary in this world is true here.

The philosophical significance goes beyond formal elegance. Possible worlds semantics gives a uniform account of de dicto and de re modality — the difference between necessity attributed to a proposition versus necessity attributed to an object's property. "Necessarily, the number of planets is greater than seven" (de dicto) is false: in some worlds, there are fewer planets. "Eight necessarily has the property of being greater than seven" (de re) is true: in every world, eight exceeds seven. The analysis uses rigid designators — terms like numerals and proper names that pick out the same object in every world — versus non-rigid descriptions like "the number of planets." Kripke's insight was that names are rigid while descriptions often are not, which explains why "Aristotle was necessarily Aristotle" is true but "Aristotle was necessarily the teacher of Alexander" is not.

The framework extends naturally to counterfactual conditionals: "if it had rained, the match would have been canceled" is true at a world w if and only if the closest worlds to w where it rained are worlds where the match was canceled. "Closest" is measured by a similarity ordering — Lewis's account uses exactly this structure. Possible worlds semantics thus serves triple duty: it formalizes modal logic, provides truth conditions for modal language in natural language, and underpins the semantics of counterfactuals. Understanding the unifying role of this framework — how a single ontological apparatus addresses questions from logic, language, and metaphysics simultaneously — is what makes it central to contemporary analytic philosophy.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

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 → A Priori and A Posteriori Knowledge → Rationalism vs. Empiricism → The Problem of Induction → Popper's Falsificationism → Falsifiability as the Criterion of Demarcation → The Falsifiability Criterion and Its Problems → Kuhn's Paradigm Theory → Normal Science and Anomalies → Thomas Kuhn and Paradigm Shifts → Scientific Progress and Convergence to Truth → Scientific Realism → Naturalism About Semantic Facts → Propositions and Semantic Content → Truth Conditions and Meaning → Formal Language and Natural Language Semantics → Two-Dimensional Semantics → Modal Semantics and Possible Worlds

Longest path: 114 steps · 751 total prerequisite topics

Prerequisites (4)

Leads To (7)