Documentation

Studies.Roberts2023

Roberts (2023): Imperatives in dynamic pragmatics #

This file formalizes the paper's semantics and dynamic pragmatics for imperative mood. An imperative denotes a property indexed to the addressee, its realization conditions. Over circumstances, world–time pairs, a goal-based ordering source gives an agent's goals at a circumstance in priority order, the timely futures of a circumstance are its possible futures at which those goals remain in force, timelyFut, and a futurate circumstantial modal base delivers the actual future circumstances in which realizing the prejacent is feasible, IsFuturate. The paper's first-pass preference over circumstances ranks them by the highest-priority goal and breaks ties by the next, which is the lexicographic order on goal profiles, profile; it refines Kratzer's ordering, profile_le_of_atLeastAsGoodAs. The applicable circumstances are those in whose timely futures realizing the prejacent is never worse, by the goals held there, than not realizing it, applic, and the property holds of an addressee who in every applicable circumstance comes to realize the prejacent in time, realizes. The content is conditional and futurate but not deontic: an if-clause restricts the modal base, realizes_restrict, and deontic force arises only when a direction is accepted and the realization of the property joins the addressee's goals on the scoreboard, after which, other goals being equal, circumstances realizing it are preferred, Scoreboard.accept_prefers. The illocutionary force linking principle sends each type of denotation to the scoreboard coordinate it updates, Denotation.defaultForce, and the conservativity presupposition on imperative subjects restricts quantificational subjects to the addressees, nobody_livesOn, so that Nobody move! directs each addressee not to move, realizes_nobody_move.

Implementation notes #

A goal-based ordering source assigns each circumstance its goals in priority order, whose set is a Kratzer ordering source over circumstances (Background), and possible futures are the substrate's futureHistoryBase; a goal held at a circumstance remains in force at a later one when it is among the goals held there. The goal profile of a circumstance is the list of its goals' truth values in priority order, so goal-relative preference is < on List Prop, the lexicographic order with False < True, and "at least as good" in the applicability condition is its negation ≤, which agrees with the paper's ≥ because the order is total. The property an accepted direction adds to the goals is the imperative's denotation, its realization conditions, and the paper leaves where it enters the hierarchy open; here it is appended below the goals already held. The common ground is the library's filter with the Stalnakerian assertion of Discourse/CommonGround.lean, so the scoreboard is a HasAssertion instance. The addressee-part relation is flattened to membership in the set of addressees, and the restriction of the property to addressees, which the paper writes as a domain restriction on the abstracted individual, is left to the conservativity presupposition rather than built into the domain of realizes.

TODO #

References #

Goal profiles #

def Roberts2023.profile {W : Type u_1} {T : Type u_2} (G : List (Reference.Index W T → Prop)) (c : Reference.Index W T) :
List Prop

The goal profile of a circumstance under goals ranked by priority: whether it realizes each goal, highest priority first. Goal-relative preference (52), the paper's first pass, is the lexicographic order on profiles: profile G c < profile G c' when c' realizes the first goal on which they differ.

Equations
Instances For
    theorem Roberts2023.profile_le_of_atLeastAsGoodAs {W : Type u_1} {T : Type u_2} {G : List (Reference.Index W T → Prop)} {c c' : Reference.Index W T} (h : c ≤ c') :
    profile G c' ≤ profile G c

    Goal-relative preference refines Kratzer's ordering: a circumstance realizing every goal another realizes has at least as good a profile.

    theorem Roberts2023.profile_lt_of_strictlyBetter {W : Type u_1} {T : Type u_2} {G : List (Reference.Index W T → Prop)} {c c' : Reference.Index W T} (h : c < c') :
    profile G c' < profile G c

    Goal-relative preference refines Kratzer's strict ordering: a circumstance realizing strictly more goals than another has a strictly better profile.

    Circumstances, goals and futures #

    def Roberts2023.timelyFut {W : Type u_1} {T : Type u_2} [Preorder T] (history : HistoricalAlternatives W T) (g : Reference.Index W T → List (Reference.Index W T → Prop)) (c : Reference.Index W T) :
    Set (Reference.Index W T)

    The timely future circumstances of a circumstance (50): its possible futures at which the goals held at it remain in force.

    Equations
    Instances For
      theorem Roberts2023.timelyFut_subset {W : Type u_1} {T : Type u_2} [Preorder T] (history : HistoricalAlternatives W T) (g : Reference.Index W T → List (Reference.Index W T → Prop)) (c : Reference.Index W T) :
      timelyFut history g c ⊆ history.futureHistoryBase c
      def Roberts2023.IsFuturate {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] (history : HistoricalAlternatives W T) (g : Reference.Index W T → List (Reference.Index W T → Prop)) (f : Modality.Background (Reference.Index W T)) (P : Reference.Index W T → E → Prop) (a : E) :

      A futurate circumstantial modal base (51) for the realization of P by a: every circumstance compatible with the base at a circumstance lies in its world, later than it, and has a timely future at which a realizes P.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        def Roberts2023.applic {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] (history : HistoricalAlternatives W T) (g : Reference.Index W T → List (Reference.Index W T → Prop)) (f : Modality.Background (Reference.Index W T)) (P : Reference.Index W T → E → Prop) (a : E) (c : Reference.Index W T) :
        Set (Reference.Index W T)

        The applicable circumstances (53) for the realization of P by a at c: those compatible with the modal base at c in whose timely futures a realizer of P is at least as good as a non-realizer by the goals held there.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          def Roberts2023.realizes {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] (history : HistoricalAlternatives W T) (g : Reference.Index W T → List (Reference.Index W T → Prop)) (f : Modality.Background (Reference.Index W T)) (P : Reference.Index W T → E → Prop) (a : E) (c : Reference.Index W T) :

          The realization conditions (54): a has the property at c when in every applicable circumstance a comes, at a timely later time in the same world, to realize P.

          Equations
          Instances For
            theorem Roberts2023.applic_future {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} (hf : IsFuturate history g f P a) {c c' : Reference.Index W T} (h : c' ∈ applic history g f P a c) :
            c'.world = c.world ∧ c.time < c'.time

            Applicable circumstances are actual future circumstances: in the world of evaluation and later than it.

            theorem Roberts2023.realizes_time_lt {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} {c c' : Reference.Index W T} (h : realizes history g f P a c) (hc' : c' ∈ applic history g f P a c) :
            ∃ (t' : T), c'.time < t' ∧ P (c'.world, t') a

            Realization is later still: the property is futurate.

            theorem Roberts2023.not_mem_applic {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} {c c' c₁ c₂ : Reference.Index W T} (h₁ : c₁ ∈ timelyFut history g c') (h₂ : c₂ ∈ timelyFut history g c') (hP : P c₁ a) (hnP : ¬P c₂ a) (hlt : profile (g c') c₁ < profile (g c') c₂) :
            c' ∉ applic history g f P a c

            A circumstance at whose timely futures realizing the prejacent is worse than not, by the goals held there, is not applicable: a goal already accomplished or no longer relevant makes no circumstance applicable.

            theorem Roberts2023.not_mem_applic_of_strictlyBetter {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} {c c' c₁ c₂ : Reference.Index W T} (h₁ : c₁ ∈ timelyFut history g c') (h₂ : c₂ ∈ timelyFut history g c') (hP : P c₁ a) (hnP : ¬P c₂ a) (hlt : c₂ < c₁) :
            c' ∉ applic history g f P a c

            The first pass agrees with Kratzer wherever Kratzer decides: a circumstance at whose timely futures some non-realizer is strictly better than a realizer by the goals held there is not applicable.

            theorem Roberts2023.applic_restrict_subset {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} (q : Reference.Index W T → Prop) (c : Reference.Index W T) :
            applic history g (f.restrict q) P a c ⊆ applic history g f P a c

            An if-clause adds its proposition to the modal base, which shrinks the applicable circumstances.

            theorem Roberts2023.IsFuturate.restrict {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} (hf : IsFuturate history g f P a) (q : Reference.Index W T → Prop) :
            IsFuturate history g (f.restrict q) P a

            A futurate modal base stays futurate under an if-clause.

            theorem Roberts2023.realizes_restrict {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {P : Reference.Index W T → E → Prop} {a : E} {c : Reference.Index W T} (h : realizes history g f P a c) (q : Reference.Index W T → Prop) :
            realizes history g (f.restrict q) P a c

            Imperatives are conditional: a direction entails its restriction by an if-clause, which only makes explicit some of the conditions on applicability.

            The scoreboard and the pragmatics of direction #

            structure Roberts2023.Scoreboard (I : Type u_4) (W : Type u_5) (T : Type u_6) :
            Type (max (max u_4 u_5) u_6)

            The central coordinates of the scoreboard: the common ground, the questions under discussion, and each interlocutor's evident goals in priority order.

            • cg : Filter (Reference.Index W T)

              The common ground, the propositions the interlocutors accept.

            • qud : List (Question (Reference.Index W T))

              The questions under discussion, the immediate one first.

            • goals : I → List (Reference.Index W T → Prop)

              Each interlocutor's evident goals, highest priority first.

            Instances For
              inductive Roberts2023.Denotation (I : Type u_4) (W : Type u_5) (T : Type u_6) :
              Type (max (max u_4 u_5) u_6)

              The denotation of a root sentence: a proposition, a question, or a property indexed to the addressee, an imperative's realization conditions.

              Instances For

                The illocutionary force linking principle (56): the default force of a root sentence, assertion, interrogation or direction, is fixed by the type of its denotation.

                Equations
                Instances For
                  @[instance_reducible]

                  Assertion (57) is Stalnaker's: an accepted proposition joins the common ground.

                  Equations
                  • One or more equations did not get rendered due to their size.
                  def Roberts2023.Scoreboard.accept {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) :
                  Denotation I W T → Scoreboard I W T

                  Accepting a move (57), (58), (59): an asserted proposition joins the common ground, a posed question the questions under discussion, and a property directed to i adds its realization by i to i's goals, below those already held.

                  Equations
                  Instances For
                    @[simp]
                    theorem Roberts2023.Scoreboard.accept_proposition {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) (p : Set (Reference.Index W T)) :
                    @[simp]
                    theorem Roberts2023.Scoreboard.commonGround_accept_property {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) (P : Reference.Index W T → I → Prop) :

                    A direction leaves the common ground untouched.

                    @[simp]
                    theorem Roberts2023.Scoreboard.accept_property_qud {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) (P : Reference.Index W T → I → Prop) :

                    A direction leaves the questions under discussion untouched.

                    @[simp]
                    theorem Roberts2023.Scoreboard.accept_property_goals {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) (P : Reference.Index W T → I → Prop) :
                    (K.accept i (Denotation.property P)).goals i = K.goals i ++ [fun (x : Reference.Index W T) => P x i]
                    @[simp]
                    theorem Roberts2023.Scoreboard.accept_property_goals_of_ne {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) (P : Reference.Index W T → I → Prop) {j : I} (hj : j ≠ i) :

                    A direction leaves the goals of every other interlocutor untouched.

                    theorem Roberts2023.Scoreboard.accept_prefers {W : Type u_1} {T : Type u_2} {I : Type u_4} [DecidableEq I] (K : Scoreboard I W T) (i : I) (P : Reference.Index W T → I → Prop) {c c' : Reference.Index W T} (h : ∀ p ∈ K.goals i, p c ↔ p c') (hc : P c i) (hc' : ¬P c' i) :

                    Deontic force is pragmatic: once i accepts a direction, among circumstances alike with respect to i's prior goals one in which i realizes the property is preferred to one in which i does not.

                    Imperative subjects #

                    def Roberts2023.nobody {E : Type u_3} (addr : E → Prop) :

                    Nobody restricted to the addressees (68). The second-person pronoun (66), overt or null, is the Montague lift NP.individual of an addressee, which lives on the set of addressees by NP.individual_livesOn.

                    Equations
                    Instances For
                      theorem Roberts2023.nobody_livesOn {E : Type u_3} (addr : E → Prop) :
                      (nobody addr).LivesOn addr

                      Restricted nobody satisfies the conservativity presupposition, since no is conservative.

                      theorem Roberts2023.realizes_nobody_move {W : Type u_1} {T : Type u_2} {E : Type u_3} [Preorder T] {history : HistoricalAlternatives W T} {g : Reference.Index W T → List (Reference.Index W T → Prop)} {f : Modality.Background (Reference.Index W T)} {addr : E → Prop} {move : Reference.Index W T → E → Prop} {c c' : Reference.Index W T} {x y : E} (h : realizes history g f (fun (c : Reference.Index W T) (x : E) => nobody addr (move c)) x c) (hc' : c' ∈ applic history g f (fun (c : Reference.Index W T) (x : E) => nobody addr (move c)) x c) (hy : addr y) :
                      ∃ (t' : T), c'.time < t' ∧ ¬move (c'.world, t') y ∧ (c'.world, t') ∈ timelyFut history g c'

                      The derivation (42′) of Nobody move!: the addressees have the property when in every applicable circumstance there is a timely later time at which none of them moves, so each of them is directed not to move in the applicable circumstances.