Documentation

Linglib.Semantics.Attitudes.NegRaising

Neg-Raising as O→E Pragmatic Strengthening #

[Gaj07] [Hor01]

Neg-raising is the phenomenon where the negation of an attitude verb is interpreted as the attitude applied to the negated complement:

"I don't think it's raining" ≈ "I think it's not raining" ¬Bel(p) → Bel(¬p)

In terms of the Square of Opposition, this is strengthening from the O-corner (¬Bel(p)) to the E-corner (Bel(¬p)). This strengthening is available precisely because belief and disbelief are contraries: one can neither believe p nor believe ¬p (the "undecided" gap). The pragmatic inference fills this gap by assuming the agent has a settled opinion.

The Doxastic Square #

        contraries
  Bel(p) ────────── Bel(¬p)
    │ │
    │ │
    │ │
  ◇p ──────────────── ¬Bel(p)
       subcontraries

Neg-raising is available for believe and think (non-veridical: there is a gap between ¬Bel(p) and Bel(¬p)) but NOT for know (veridical: ¬know(p) includes cases where p is false, so strengthening to know(¬p) would require ¬p to be true, which is a factual claim the speaker may not intend).

See also #

The domain-general structural core — neg-raising / force collapse ⟺ the modal's domain being a subsingleton — lives in Semantics/Homogeneity/Decided.lean. This file is the doxastic (believe / think / know) application layer.

The doxastic square #

def Semantics.Attitudes.NegRaising.doxasticSquare {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) :

The doxastic square for a belief predicate.

Given an accessibility relation, agent, and proposition, produce the four corners of the doxastic square of opposition:

  • A = Bel(p): all doxastic alternatives satisfy p
  • E = Bel(¬p): all doxastic alternatives satisfy ¬p
  • I = ◇p: some doxastic alternative satisfies p
  • O = ¬Bel(p): not all doxastic alternatives satisfy p
Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem Semantics.Attitudes.NegRaising.doxasticSquare_contradAO {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :
    (doxasticSquare R agent worlds p).A w ¬(doxasticSquare R agent worlds p).O w

    The doxastic square satisfies the A–O contradiction diagonal.

    theorem Semantics.Attitudes.NegRaising.doxasticSquare_contradEI {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :
    (doxasticSquare R agent worlds p).E w ¬(doxasticSquare R agent worlds p).I w

    The doxastic square satisfies the E–I contradiction diagonal.

    This requires that diaAt is the dual of boxAt: ◇p = ¬□¬p. We prove this from the definitions.

    Neg-raising and the excluded-middle premise #

    Neg-raising is the O→E inference ¬Bel(p) → Bel(¬p). It is not generally valid: for a non-veridical attitude the doxastic state is mixed, so ¬Bel(p) leaves a gap. What licenses the strengthening is the excluded-middle premise that the agent is opinionated about p (Bel(p) ∨ Bel(¬p)), supplied pragmatically ([Gaj07]); given it the inference is a disjunctive syllogism. Being opinionated about every prejacent is exactly the decided/subsingleton limit (Homogeneity.excludedMiddle_iff_subsingleton), where neg-raising holds as a validity rather than a defeasible move.

    def Semantics.Attitudes.NegRaising.negRaisesAt {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :

    Neg-raising: the O→E inference ¬Bel(p) → Bel(¬p) at a world.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      def Semantics.Attitudes.NegRaising.opinionated {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :

      The excluded-middle premise: the agent is opinionated about p, believing p or believing ¬p. Gajewski's neg-raising presupposition.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem Semantics.Attitudes.NegRaising.negRaisesAt_of_opinionated {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :
        opinionated R agent worlds p wnegRaisesAt R agent worlds p w

        The pragmatic mechanism. Opinionatedness about p licenses the O→E strengthening — a disjunctive syllogism. Neg-raising is this inference run on the (pragmatically presupposed) excluded-middle premise, not a semantic entailment.

        def Semantics.Attitudes.NegRaising.accessibleSet {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (w : W) :
        Set W

        The accessible-worlds set at w; boxAt … p is ∀ w' ∈ accessibleSet, p w'.

        Equations
        Instances For
          theorem Semantics.Attitudes.NegRaising.boxAt_iff_forall_accessibleSet {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :
          Doxastic.boxAt R agent w worlds p w'accessibleSet R agent worlds w, p w'
          theorem Semantics.Attitudes.NegRaising.forall_opinionated_iff_subsingleton {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (w : W) :
          (∀ (p : WProp), opinionated R agent worlds p w) (accessibleSet R agent worlds w).Subsingleton

          Validity ⟺ decided state. The agent is opinionated about every prejacent (neg-raising then holds as a validity) iff the accessible state is decided — a subsingleton — connecting the doxastic layer to the shared Homogeneity core.

          Neg-raising is available exactly when the predicate admits a gap between ¬Bel(p) and Bel(¬p) — i.e., when the O→E strengthening is a genuine pragmatic move (not a semantic entailment).

          For non-veridical predicates, ¬Bel(p) does NOT semantically entail Bel(¬p) — there is a gap (the agent might be undecided). Neg-raising fills this gap pragmatically.

          For veridical predicates (know), ¬know(p) could mean either: (a) p is true but agent doesn't know it, or (b) p is false Strengthening to know(¬p) would require (b), which is a factual claim beyond pragmatic strengthening.

          Equations
          Instances For

            Veridicality and square lemmas #

            The standard predicates' neg-raising status is derived from their veridicality, not stipulated as a flag: believe and think are non-veridical (neg-raising available), know is veridical (not).

            theorem Semantics.Attitudes.NegRaising.believe_square_contradictions {W : Type u_1} {E : Type u_2} (R : Doxastic.AccessRel W E) (agent : E) (worlds : List W) (p : WProp) (w : W) :
            ((doxasticSquare R agent worlds p).A w ¬(doxasticSquare R agent worlds p).O w) ((doxasticSquare R agent worlds p).E w ¬(doxasticSquare R agent worlds p).I w)

            The doxastic square for "believe" satisfies the contradiction diagonals.