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 SemanticsFormal 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicModal Semantics: Necessity and PossibilityIntensionality and Possible Worlds SemanticsEvent SemanticsEvent Semantics: Formal Representation of Eventualities

Longest path: 101 steps · 632 total prerequisite topics

Prerequisites (2)

Leads To (2)