Documentation

Linglib.Theories.Semantics.Modality.Kratzer.XMarking

X-Marking on Necessity Modals #

@cite{ferreira-2023} @cite{von-fintel-iatridou-2023}

X-marking is a morphological operation (realized as past imperfect in Portuguese, covert ambiguity in English) that shifts the modal parameters of necessity modals without changing their quantificational force (both remain ∀ over best worlds).

Two independent X-marking operations target the two Kratzerian parameters:

Applied to strong necessity (SN), these generate the square of necessities:

    SN ────Xf────→ SN_Xf
    │                │
    Xg               Xg
    │                │
    SN_Xg ──Xf────→ SN_{Xf,g}

The central equation: WN ≡ SN_Xg — weak necessity IS strong necessity with X-marked ordering source.

Star-revision: X-marking on modal bases (Xf) #

structure Semantics.Modality.Kratzer.XMarking.IsStarRevision {W : Type u_1} (f f' : ModalBase W) (p : WProp) :

Property: f' is a ∗-revision of f for p (@cite{ferreira-2023}). UNVERIFIED: §3 reference removed pending check against the JoS pdf.

A ∗-revision widens the modal domain by adding p-worlds: (1) every world accessible under f remains accessible under f', (2) every newly accessible world satisfies p.

Instances For
    theorem Semantics.Modality.Kratzer.XMarking.starRevision_widens {W : Type u_1} {f f' : ModalBase W} {p : WProp} (h : IsStarRevision f f' p) (w w' : W) (hw : w' accessibleWorlds f w) :
    w' accessibleWorlds f' w
    theorem Semantics.Modality.Kratzer.XMarking.starRevision_new_satisfy_p {W : Type u_1} {f f' : ModalBase W} {p : WProp} (h : IsStarRevision f f' p) (w w' : W) (hw' : w' accessibleWorlds f' w) (hnew : w'accessibleWorlds f w) :
    p w'

    Double-star-revision: X-marking on ordering sources (Xg) #

    Xg: X-marking targeting the ordering source (∗∗-revision). Adds a secondary ordering that favors p-worlds among the best worlds.

    Equations
    Instances For

      The four vertices of the square #

      @[reducible, inline]
      abbrev Semantics.Modality.Kratzer.XMarking.sn {W : Type u_1} (f : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) :
      Equations
      Instances For
        @[reducible]
        def Semantics.Modality.Kratzer.XMarking.snXf {W : Type u_1} (f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) :
        Equations
        Instances For

          Key equation: WN ≡ SN_Xg #

          theorem Semantics.Modality.Kratzer.XMarking.wn_equiv_snXg {W : Type u_1} (f : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) :
          Directive.weakNecessity f g (fun (x : W) => [p]) p w snXg f g p w

          Entailment: SN → SN_Xg (must → ought) #

          theorem Semantics.Modality.Kratzer.XMarking.sn_entails_snXg {W : Type u_1} (f : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) (h : sn f g p w) :
          snXg f g p w
          theorem Semantics.Modality.Kratzer.XMarking.snXg_not_entails_sn :
          ¬∀ (W : Type) (f : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W), snXg f g p wsn f g p w

          The converse fails: SN_Xg ⊭ SN.

          Counterexample: W = Bool, f = universal access, g = trivial ordering, p = (· = true). Then snXg holds (xMarkOrdering favors true so best = {true}), but sn fails (all accessible worlds best under empty ordering, p false is false).

          Forward entailment: SN → SN_Xf under star-revision #

          theorem Semantics.Modality.Kratzer.XMarking.sn_entails_snXf {W : Type u_1} (f f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) (hRev : IsStarRevision f f' p) (hSN : sn f g p w) :
          snXf f' g p w

          Forward entailments along square edges #

          theorem Semantics.Modality.Kratzer.XMarking.snXg_entails_snXfg {W : Type u_1} (f f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) (hRev : IsStarRevision f f' p) (h : snXg f g p w) :
          snXfg f' g p w
          theorem Semantics.Modality.Kratzer.XMarking.snXf_entails_snXfg {W : Type u_1} (f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) (h : snXf f' g p w) :
          snXfg f' g p w

          Non-entailment: reverse arrows fail #

          theorem Semantics.Modality.Kratzer.XMarking.xMarked_unmarked_independent :
          ¬∀ (W : Type) (f f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W), IsStarRevision f f' psnXfg f' g p wsnXg f g p w
          theorem Semantics.Modality.Kratzer.XMarking.snXfg_not_entails_snXf :
          ¬∀ (W : Type) (f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W), snXfg f' g p wsnXf f' g p w
          theorem Semantics.Modality.Kratzer.XMarking.xf_is_universal {W : Type u_1} (f' : ModalBase W) (g : OrderingSource W) (p : WProp) (w : W) :
          snXf f' g p w w'bestWorlds f' g w, p w'

          Xf preserves the quantifier: SN_Xf is still ∀ over best worlds.