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

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

Declarations

theorem foldl_inf_principalL65–72
{W : Type u_1} (c : Filter W) (h : List (Set W)) :
List.foldl (fun (x1 : Filter W) (x2 : Set W) => x1 βŠ“ principal x2) c h = c βŠ“ principal (β‹‚ p ∈ h, p)
L74–77
theorem foldl_inf_principal_antiL80–83
{W : Type u_1} {c : Filter W} {h₁ hβ‚‚ : List (Set W)} (hs : h₁ βŠ† hβ‚‚) :
List.foldl (fun (x1 : Filter W) (x2 : Set W) => x1 βŠ“ principal x2) c hβ‚‚ ≀ List.foldl (fun (x1 : Filter W) (x2 : Set W) => x1 βŠ“ principal x2) c h₁