Documentation

Linglib.Semantics.Modality.Directive

Directive Modality: Strong and Weak Necessity #

[Kra12] [vFI08]

[vFI08] argue that natural languages systematically distinguish strong necessity ("must", "have to") from weak necessity ("ought", "should"). The difference is not in modal force — both are universal quantifiers over best worlds — but in the ordering source.

Core Analysis #

Strong and weak necessity share the same modal base (circumstantial) but differ in ordering:

The secondary ordering g' adds criteria beyond the primary norms, creating a more discriminating ranking. More criteria → smaller "best" set → the universal quantification is over a subset, making it a weaker (easier to satisfy) claim.

Key Result #

strong_entails_weak: strong necessity entails weak necessity. If all g-best worlds have φ, then all (g∪g')-best worlds have φ, because the refined best set is a subset of the original.

weak_not_entails_strong: the converse fails. A concrete counterexample shows that refining the ordering can eliminate a world where φ fails, making weak necessity hold while strong necessity does not.

Connection to Kratzer Framework #

Strong necessity IS Kratzer's standard necessity from Kratzer.lean. Weak necessity adds a secondary ordering source via combineOrdering. The DeonticStrength structure pairs primary and secondary norms, bridging to DeonticFlavor.

Combined ordering sources #

Combine two ordering sources by concatenation. The combined source g₁ ∪ g₂ yields the union of ideals from both.

Equations
Instances For
    theorem Semantics.Modality.Directive.primary_sub_combined {W : Type u_1} (g g' : Kratzer.OrderingSource W) (w : W) (p : WProp) :
    p g wp combineOrdering g g' w

    The primary ordering is contained in the combined one.

    Combining with empty ordering preserves the original.

    Strong and weak necessity #

    Strong necessity ("must φ"): standard Kratzer necessity.

    Equations
    Instances For

      Weak necessity ("ought φ"): Kratzer necessity under refined ordering g ∪ g'.

      Equations
      Instances For

        Ordering extension lemma #

        Best worlds monotonicity #

        theorem Semantics.Modality.Directive.best_refines {W : Type u_1} (f : Kratzer.ModalBase W) (g g' : Kratzer.OrderingSource W) (w w' : W) :
        w' Kratzer.bestWorlds f (combineOrdering g g') ww' Kratzer.bestWorlds f g w

        Refining the ordering can only shrink the set of best worlds.

        Main entailment #

        theorem Semantics.Modality.Directive.strong_entails_weak {W : Type u_1} (f : Kratzer.ModalBase W) (g g' : Kratzer.OrderingSource W) (p : WProp) (w : W) (h : strongNecessity f g p w) :
        weakNecessity f g g' p w

        Strong entails weak: if "must φ" holds, then "ought φ" holds.

        The converse fails #

        theorem Semantics.Modality.Directive.weak_not_entails_strong :
        ¬∀ (W : Type) (f : Kratzer.ModalBase W) (g g' : Kratzer.OrderingSource W) (p : WProp) (w : W), weakNecessity f g g' p wstrongNecessity f g p w

        Weak necessity does NOT entail strong necessity.

        Counterexample: W = Bool. g is the trivial ordering (all worlds tied); g' identifies true. Under g, both true and false are best; under g∪g', only true is best. With p = (· = true), weakNecessity holds (only true ∈ best), but strongNecessity fails (false ∈ best, p false).

        Deontic application #

        Instances For
          theorem Semantics.Modality.Directive.deontic_must_entails_ought {W : Type u_1} (d : DeonticStrength W) (p : WProp) (w : W) (h : d.must p w) :
          d.ought p w