Docs / Discourse / CommonGround
Common ground
import Linglib.Discourse.CommonGround Β· namespace Filter
The common ground of a conversation is the set of propositions the interlocutors mutually
accept, as Stalnaker and, independently, Karttunen describe it. Acceptance is closed under
entailment and finite conjunction and contains the trivial proposition, so the common ground is
a filter on worlds, like Chellas's augmented models and GΓ€rdenfors's deductively closed belief
sets. Stalnaker's context set, the worlds compatible with everything accepted, is its kernel
Filter.ker, and a bare context set cs is the principal common ground π cs, the two related
by mathlib's Filter.giPrincipalKer. Asserting Ο takes a common ground c to c β π Ο, which
intersects the context set with Ο (Filter.ker_inf), so a history of assertions lands on the
principal filter of their intersection in whatever order they are made, and a history that
asserts more leaves a stronger common ground.
A framework whose discourse states carry more than a common ground projects them to one, and its
assertion is Stalnakerian when the projection semiconjugates it to Β· β π Ο
(Function.Semiconj), which List.foldl_hom extends to histories: the mood state's assertion is
(Mood.State.semiconj_assert), and so is the scoreboard's
(Roberts2023.Scoreboard.semiconj_assert). Farkas and Bruce's assertion leaves the common ground
as it is, a proposal until it is settled (Commitment.Table.commonGround_assert), and Anderson's
graded update joins the common ground with the evidence's instead of meeting it
(Anderson2021.ae_updateCG).
Main statements
Filter.foldl_inf_principal: a history of assertions lands on the principal filter of the intersection of what it asserts.Filter.foldl_inf_principal_anti: a history that asserts more leaves a stronger common ground.
Implementation notes
The filter axioms are the body-of-information view of the common ground that Geurts surveys,
and they carry no epistemology. Whether what grounds them is Stalnaker's iterated common belief,
his later common acceptance as a primitive, or Lederman's non-iterated minimal theory is stated
separately, as Filter.GroundedIn in Logic/Modal/Epistemic.lean; closure of acceptance under
conjunction, the filter's inter_sets, is the axiom Lederman contests.
References
- Stalnaker 1973, Presuppositions
- Stalnaker 1978, Assertion formalized
- Stalnaker 2002, Common Ground
- Stalnaker 2014, Context
- Karttunen 1974, Presupposition and Linguistic Context formalized
- Chellas 1980, Modal Logic: An Introduction
- GΓ€rdenfors 1988, Knowledge in Flux: Modeling the Dynamics of Epistemic States
- Geurts 2024, Common Ground in Pragmatics
- Lederman 2014, A Theory of Common Ground
- Farkas & Bruce 2010, On Reacting to Assertions and Polar Questions formalized
- Anderson 2021, Tell Me Everything You Know: A Conversation Update System for the Rational Speech Acts Framework formalized
Declarations
From the trivial common ground, a history of assertions is the principal filter of what it asserts, the free model of Stalnakerian assertion (Stalnaker 1973 p. 450).