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

Common Knowledge and Mutual Knowledge

Graduate Depth 117 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
768prerequisites beneath it
See this on the map →
Knowledge and Belief OperatorsFirst-Order Logic Syntax→→Collective Knowledge and Group Epistemology
group-knowledge iteration common-ground

Core Idea

Mutual knowledge that p means each agent knows p; common knowledge that p means each agent knows p, each agent knows that each knows p, and so on infinitely. Formally, common knowledge is the limit of an infinite sequence of nested operators: everyone knows p, everyone knows everyone knows p, etc. Common knowledge is crucial for coordinating behavior and understanding discourse, yet is surprisingly difficult to achieve.

Explainer

You've studied knowledge and belief operators — the formal tools for reasoning about what agents know: K_i(p) means agent i knows p. Mutual knowledge now extends this to groups. If agents A and B both know that it will rain, then we have mutual knowledge that it will rain: K_A(rain) ∧ K_B(rain). This seems like enough for coordination — if both people know to bring umbrellas, they'll both bring umbrellas. But a classic puzzle shows that mutual knowledge often is not enough.

Consider the coordinated attack problem: two generals, A and B, plan to attack simultaneously at dawn. General A sends a messenger to B confirming the attack. But A cannot attack until B confirms receipt, because if the messenger is lost, A attacks alone and loses. So B sends a confirmation. But now B can't be sure A got *that* confirmation, so A must confirm the confirmation — and so on infinitely. Each round of messaging adds one layer: "I know you know," "I know you know I know," etc. No finite number of confirmation rounds ever achieves genuine coordination certainty. What the generals need is common knowledge — an infinite iteration of nested knowledge that the attack is on — and that is precisely what a finite sequence of fallible messages cannot guarantee.

Formally, common knowledge that p (written CK(p)) is defined as: everyone knows p, *and* everyone knows that everyone knows p, *and* everyone knows that everyone knows that everyone knows p, *and* so on without end. Using the knowledge operator K, if we let E(p) mean "everyone knows p," then common knowledge is E(p) ∧ E(E(p)) ∧ E(E(E(p))) ∧ ... — the infinite conjunction. This is not just philosophical abstraction: common knowledge is the epistemic condition required for genuine convention. A word means what it means, a traffic light works as it does, money has value — all because everyone knows the convention, everyone knows everyone knows it, and so on. Without that infinite-iteration structure, coordination is fragile.

Common knowledge is also surprisingly rare in practice. You and a friend may both know that a party was awkward — but do you both know that you both know? And do you both know that? A public announcement — something heard simultaneously by all parties with no private uncertainty — is one of the few mechanisms that generates genuine common knowledge instantly. This is why rituals, public ceremonies, and formal declarations have such social power: they produce common knowledge by design. The mutual-to-common knowledge gap explains a host of social phenomena, from why whispered agreements are less binding than public ones to why scientific consensus requires public publication rather than private circulation of findings.

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 → Possible Worlds Semantics for Knowledge → Epistemic Accessibility Relations → Knowledge and Belief Operators → Common Knowledge and Mutual Knowledge

Longest path: 118 steps · 768 total prerequisite topics

Prerequisites (2)

Leads To (1)