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:
Xf (modal base revision): widens the domain ∩f_w by suspending presupposed evidence against the prejacent, adding p-worlds similar to currently accessible worlds.
Xg (ordering source revision): refines the ordering by favoring p-worlds among those previously ranked as best.
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) #
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.
- widens (w w' : W) : w' ∈ accessibleWorlds f w → w' ∈ accessibleWorlds f' w
- new_satisfy_p (w w' : W) : w' ∈ accessibleWorlds f' w → w' ∉ accessibleWorlds f w → p w'
Instances For
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
- Semantics.Modality.Kratzer.XMarking.xMarkOrdering g p = Semantics.Modality.Directive.combineOrdering g fun (x : W) => [p]
Instances For
The four vertices of the square #
Equations
- Semantics.Modality.Kratzer.XMarking.sn f g p w = Semantics.Modality.Kratzer.necessity f g p w
Instances For
Equations
Instances For
Equations
- Semantics.Modality.Kratzer.XMarking.snXf f' g p w = Semantics.Modality.Kratzer.necessity f' g p w
Instances For
Equations
Instances For
Key equation: WN ≡ SN_Xg #
Entailment: SN → SN_Xg (must → ought) #
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 #
Forward entailments along square edges #
Non-entailment: reverse arrows fail #
Xf preserves the quantifier: SN_Xf is still ∀ over best worlds.