Dynamic semantics¶
Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.
Core Idea¶
Dynamic semantics is treated here as the recurring formal semantics identity summarized by this source-grounded definition: Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context. Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context. In static semantics, knowing the meaning of a sentence amounts to knowing when it is true; in dynamic semantics, knowing the meaning of a sentence means knowing "the change.
Scope of Application¶
-
Update semantics. In update semantics, each formula \varphi is mapped to a function [\varphi] that takes and returns a discourse context.
-
Update semantics. In particular, it allows information sensitive semantic entries, in which the information contributed by updating with some formula can depend on the information already present in the context.
-
Update semantics. This property of update semantics has led to its widespread application to presuppositions, modals, and conditionals.
-
Documented setting. In static semantics, knowing the meaning of a sentence amounts to knowing when it is true; in dynamic semantics, knowing the meaning of a sentence means knowing "the change it brings.
-
Dynamics of anaphora. The first systems of dynamic semantics were the closely related File Change Semantics and discourse representation theory, developed simultaneously and independently by Irene Heim and Hans Kamp.
Clarity¶
A clear use of Dynamic semantics names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.
Manages Complexity¶
Dynamic semantics compresses multiple formal semantics details into a stable diagnostic relation. The source shows both the central mechanism—the first systems of dynamic semantics were the closely related File Change Semantics and discourse representation theory, developed simultaneously and independently by Irene Heim and Hans Kamp.—and the practical consequence—thus, if C is a context, then C[\varphi] is the context one gets by updating C with \varphi .
Abstract Reasoning¶
- Type the carrier. Identify the formal semantics entities to which the claim applies.
- State the relation. Use the source-grounded identity: Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.
- Check operation and conditions. Donkey anaphora is exemplified by the infamous donkey sentences, first noticed by the medieval logician Walter Burley and brought to modern attention by Peter Geach.
- Demand recognition evidence.
Knowledge Transfer¶
Within the home domain. Knowledge about Dynamic semantics transfers literally when a new case preserves the same carrier type, relation, and recognition test. In update semantics, each formula \varphi is mapped to a function [\varphi] that takes and returns a discourse context. In particular, it allows information sensitive semantic entries, in which the information contributed by updating with some formula can depend on the information already present in the context. Beyond the home domain. No canonical parent is asserted for Dynamic semantics.
Neighborhood in Abstraction Space¶
Dynamic semantics sits in a sparse region of the domain-specific corpus (75th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Formal Logic & Semantic Systems (18 abstractions)
Nearest neighbors
- De Morgan's Laws — 0.85
- Categorial Grammar — 0.83
- Noncontracting Grammar — 0.83
- Commonsense reasoning — 0.82
- Conjunctive grammar — 0.82
Computed from structural-signature embeddings · 2026-10-08