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

Anaphora and Discourse Context

College Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
342prerequisites beneath it
See this on the map →
First-Order Logic Semantics and StructuresRussell's Theory of Definite Descriptions→→Discourse Coherence and Rhetorical RelationsEllipsis and Covert Structure
discourse anaphora pronouns context

Core Idea

Anaphoric pronouns refer back to previously introduced discourse referents. Dynamic semantic approaches treat discourse as building up a context of available referents, with pronouns and expressions accessing this evolving context structure.

How It's Best Learned

Analyze multi-sentence discourses, identifying what serves as antecedent for each pronoun. Examine cases where anaphora is blocked by syntactic constraints to understand binding principles.

Explainer

In first-order semantics, variables get their values from a fixed assignment function—you set the value of x once, and then x refers to that value throughout. Anaphora shows that natural language works differently: the value of a pronoun depends on how the discourse has unfolded. "John walked in. He sat down." The pronoun "he" picks up its reference from the previous sentence, not from any assignment fixed in advance. This is the basic phenomenon of anaphora: an expression whose interpretation depends on something introduced earlier in the discourse.

The traditional approach—treating pronouns as directly referential or as bound variables—handles simple cases but breaks down at a famous class of examples called donkey sentences. "Every farmer who owns a donkey beats it." Here "it" can't be a bound variable (nothing in the syntax binds it in the right way) and can't be a simple referential pronoun (there's no particular donkey to refer to). Russell's theory of descriptions, which your prerequisite covered, doesn't help directly either. The pronoun seems to range over donkeys in a way that is somehow controlled by the indefinite "a donkey" inside the relative clause.

Dynamic semantics offers the key insight: treat discourse not as a static set of sentences but as a process of updating a context. Each sentence updates the discourse context by introducing new discourse referents and adding information about them. Indefinite noun phrases like "a farmer" or "a donkey" introduce new referents into the context; pronouns pick up referents that are already available in the context. Formally, this is modeled by treating sentence meanings as relations between input and output contexts rather than as static truth conditions. A sentence processes an incoming information state and produces an updated one, potentially adding new referents to the available stock.

This dynamic approach handles donkey sentences by allowing quantifiers to "reset" and re-bind referents: "a donkey" introduces a referent within the scope of the universal, and "it" picks up that referent within the same quantificational scope. It also explains binding constraints: why "He loves John" resists a reading where "he" refers to John (anti-coreference), while "John loves himself" requires coreference. Binding principles constrain which discourse referents are syntactically accessible to a given pronoun, and dynamic semantics provides a framework for tracking which referents are in scope at any point in the discourse. The upshot is a richer picture of meaning: understanding a sentence means updating your model of the discourse context, not just evaluating a static truth condition.

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 → Russell's Theory of Definite Descriptions → Anaphora and Discourse Context

Longest path: 74 steps · 342 total prerequisite topics

Prerequisites (2)

Leads To (2)