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

Event Semantics: Formal Representation of Eventualities

Graduate Depth 100 in the knowledge graph ☐ I know this ☆ Set as goal
85topics build on this
632prerequisites beneath it
See this on the map →
Semantic Types and Compositional MeaningEvent Semantics→→Formal Semantics of Tense and TimePresupposition in Formal Semantics
semantics events formalism

Core Idea

Event semantics treats verbs as predicates over events, not just propositions. Formalized by quantifying over event variables: 'John ran' is ∃e[run(e) ∧ agent(e, john)]. This naturally captures adverbial modification and explains patterns in passivization and nominalization.

Explainer

From your work on semantic types and composition, you know how to build the meaning of a sentence by combining types: a transitive verb is a function from individuals to properties, and applying it to arguments yields a proposition. That approach works cleanly for simple subject-predicate sentences. But it encounters problems as soon as you add adverbs. In the Davidsonian tradition, "John ran quickly in the park" should entail "John ran" — if you strip away the adverbs, the core event persists. In a purely propositional semantics, "ran(john)" and "ran-quickly-in-the-park(john)" are completely separate predicates with no logical relationship. You cannot derive one from the other. Event semantics solves this by introducing a new argument slot — the event variable — into the logical representation of verbs.

The Davidsonian analysis reanalyzes verbs as relations that include an event participant. Instead of "ran(john)" as a two-place predicate, the logical form becomes ∃e[run(e) ∧ agent(e, john)]: there exists an event *e* such that *e* is a running event and John is the agent of *e*. Adverbs become predicates over the same event variable, conjoined to the main predication: "John ran quickly" → ∃e[run(e) ∧ agent(e, john) ∧ quick(e)]. Now the entailment falls out automatically: if ∃e[run(e) ∧ agent(e, john) ∧ quick(e)] is true, then ∃e[run(e) ∧ agent(e, john)] is also true, because you simply drop the conjunct. Adverbs are existential statements about the same event, not modifications of the predicate itself.

The neo-Davidsonian extension separates thematic roles entirely from the verb's argument structure. In the original Davidson, "John saw Mary" might still embed the agent and patient directly. In the neo-Davidsonian version, even subject and object are introduced as separate conjuncts: ∃e[see(e) ∧ agent(e, john) ∧ patient(e, mary)]. This modularity pays off for passivization: "Mary was seen" simply drops the agent conjunct and promotes the patient — the event predicate and the patient role remain, and the agent is existentially closed or suppressed. The semantics of passives no longer requires a separate lexical entry; it follows from the structure of the event representation.

The same logic extends to nominalization — turning verbs into nouns ("the destruction," "the running"). Nominalizations denote the same events as their verbal counterparts, allowing sentences like "The destruction was sudden" to be semantically related to "It was destroyed suddenly" via shared event variables. This also accounts for why "John's destruction of the city" and "the city's destruction" both make reference to the same underlying event with the same participants, even though the surface syntax differs. Event semantics provides a unified account of these relationships that predicate-only semantics cannot. As you proceed to more formal analyses of aspect, aktionsart, and causal structure, the event variable will appear at the center of each analysis.

Practice Questions 5 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 → Event Semantics: Formal Representation of Eventualities

Longest path: 101 steps · 632 total prerequisite topics

Prerequisites (2)

Leads To (2)