@cite{brandom-1994}: Scorekeeping Model of Assertion

@cite{brandom-1994} @cite{brandom-1983}Models assertion as a move in a normative scorekeeping game. Each participant tracks a "scorecard" for every other participant, recording two kinds of normative status:

• Commitments: what the agent has publicly committed to
• Entitlements: what the agent is entitled to assert (has reasons for)

The key insight: entitlements have no analog in Stalnaker's model. A speaker can be committed to p without being entitled to p (assertion without adequate grounds) or entitled to p without being committed (possessing evidence but not having asserted).

Scorekeeping

Each agent keeps a score for every other agent. Scores can DISAGREE: agent A might attribute commitment-to-p to agent B, while agent C does not. This means there is no single "common ground" — only an approximation derived from scorecard intersection.

Inferential Closure

If an agent is committed to p and p→q, they are inferentially committed to q (even if they haven't explicitly asserted q). This is Brandom's "material inference" — the content of a claim is determined by its inferential role.

structure Theories.Pragmatics.Assertion.Brandom.NormativeStatus (W : Type u_1) : Type u_1

The normative status attributed to an agent by a scorekeeper.

Brandom's central innovation: the deontic score has two independent dimensions. An agent can be committed-but-not-entitled (asserted without grounds), entitled-but-not-committed (has evidence, hasn't asserted), or both (well-grounded assertion).

• commitments : Core.Discourse.Commitment.CommitmentSlate W

  Propositions the agent is committed to

• entitlements : Core.Discourse.Commitment.CommitmentSlate W

  Propositions the agent is entitled to assert

def Theories.Pragmatics.Assertion.Brandom.NormativeStatus.empty {W : Type u_1} : NormativeStatus W

Empty normative status: no commitments, no entitlements.

Equations

• Theories.Pragmatics.Assertion.Brandom.NormativeStatus.empty = { commitments := Core.Discourse.Commitment.CommitmentSlate.empty, entitlements := Core.Discourse.Commitment.CommitmentSlate.empty }

def Theories.Pragmatics.Assertion.Brandom.NormativeStatus.addCommitment {W : Type u_1} (ns : NormativeStatus W) (p : BProp W) : NormativeStatus W

Add a commitment (the agent publicly commits to p).

Equations

• ns.addCommitment p = { commitments := ns.commitments.add p, entitlements := ns.entitlements }

def Theories.Pragmatics.Assertion.Brandom.NormativeStatus.addEntitlement {W : Type u_1} (ns : NormativeStatus W) (p : BProp W) : NormativeStatus W

Add an entitlement (the agent has grounds for p).

Equations

• ns.addEntitlement p = { commitments := ns.commitments, entitlements := ns.entitlements.add p }

inductive Theories.Pragmatics.Assertion.Brandom.BAgent : Type

Agent type for the scorekeeping model.

• speaker : BAgent
• addressee : BAgent

instance Theories.Pragmatics.Assertion.Brandom.instDecidableEqBAgent : DecidableEq BAgent

Equations

• Theories.Pragmatics.Assertion.Brandom.instDecidableEqBAgent x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

instance Theories.Pragmatics.Assertion.Brandom.instReprBAgent : Repr BAgent

Equations

• Theories.Pragmatics.Assertion.Brandom.instReprBAgent = { reprPrec := Theories.Pragmatics.Assertion.Brandom.instReprBAgent.repr }

def Theories.Pragmatics.Assertion.Brandom.instReprBAgent.repr : BAgent → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

instance Theories.Pragmatics.Assertion.Brandom.instBEqBAgent : BEq BAgent

Equations

• Theories.Pragmatics.Assertion.Brandom.instBEqBAgent = { beq := Theories.Pragmatics.Assertion.Brandom.instBEqBAgent.beq }

def Theories.Pragmatics.Assertion.Brandom.instBEqBAgent.beq : BAgent → BAgent → Bool

Equations

• Theories.Pragmatics.Assertion.Brandom.instBEqBAgent.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

def Theories.Pragmatics.Assertion.Brandom.instInhabitedBAgent.default : BAgent

Equations

• Theories.Pragmatics.Assertion.Brandom.instInhabitedBAgent.default = Theories.Pragmatics.Assertion.Brandom.BAgent.speaker

instance Theories.Pragmatics.Assertion.Brandom.instInhabitedBAgent : Inhabited BAgent

Equations

• Theories.Pragmatics.Assertion.Brandom.instInhabitedBAgent = { default := Theories.Pragmatics.Assertion.Brandom.instInhabitedBAgent.default }

structure Theories.Pragmatics.Assertion.Brandom.Scorecard (W : Type u_1) : Type u_1

A scorecard: what one agent attributes to another.

card a b is agent a's attribution of normative status to agent b. Crucially, card a b can differ from card c b — scorekeepers can disagree about what another agent is committed/entitled to.

• card : BAgent → BAgent → NormativeStatus W

  Agent a's view of agent b's normative status

def Theories.Pragmatics.Assertion.Brandom.Scorecard.empty {W : Type u_1} : Scorecard W

Initial scorecard: everyone attributes empty status to everyone.

Equations

• One or more equations did not get rendered due to their size.

def Theories.Pragmatics.Assertion.Brandom.Scorecard.commitmentsOf {W : Type u_1} (sc : Scorecard W) (keeper scorer : BAgent) : Core.Discourse.Commitment.CommitmentSlate W

Get a specific agent's view of another agent's commitments.

Equations

• sc.commitmentsOf keeper scorer = (sc.card keeper scorer).commitments

def Theories.Pragmatics.Assertion.Brandom.Scorecard.entitlementsOf {W : Type u_1} (sc : Scorecard W) (keeper scorer : BAgent) : Core.Discourse.Commitment.CommitmentSlate W

Get a specific agent's view of another agent's entitlements.

Equations

• sc.entitlementsOf keeper scorer = (sc.card keeper scorer).entitlements

structure Theories.Pragmatics.Assertion.Brandom.BrandomState (W : Type u_1) : Type u_1

Brandom's discourse state: a scorecard tracking all agent attributions.

• scorecard : Scorecard W

  The scorecard recording normative status attributions

def Theories.Pragmatics.Assertion.Brandom.BrandomState.empty {W : Type u_1} : BrandomState W

Initial state: empty scorecard.

Equations

• Theories.Pragmatics.Assertion.Brandom.BrandomState.empty = { scorecard := Theories.Pragmatics.Assertion.Brandom.Scorecard.empty }

def Theories.Pragmatics.Assertion.Brandom.BrandomState.assert {W : Type u_1} (s : BrandomState W) (p : BProp W) : BrandomState W

Assert: the speaker undertakes a commitment and authorizes the addressee to re-assert.

@cite{brandom-1994}: asserting p has two effects:

1. The speaker undertakes commitment to p
2. The speaker authorizes others to re-assert p (default entitlement)

Equations

• One or more equations did not get rendered due to their size.

def Theories.Pragmatics.Assertion.Brandom.BrandomState.effectiveContextSet {W : Type u_1} (s : BrandomState W) : Core.CommonGround.ContextSet W

Effective context set: intersection of all attributed commitments.

This is a LOSSY projection from Brandom → Stalnaker. Brandom's model has strictly more structure (entitlements, disagreement between scorekeepers), but for the AssertionTheory interface we need a single ContextSet.

Equations

• One or more equations did not get rendered due to their size.

def Theories.Pragmatics.Assertion.Brandom.BrandomState.isStable {W : Type u_1} (s : BrandomState W) : Bool

Stability: the state is stable when all commitments have matching entitlements (no ungrounded assertions).

Equations

• One or more equations did not get rendered due to their size.

structure Theories.Pragmatics.Assertion.Brandom.Challenge (W : Type u_1) : Type u_1

A challenge: the addressee demands reasons for a commitment.

@cite{brandom-1994}: challenges shift the burden of proof. If the speaker cannot provide entitlement for a commitment, the commitment is defeated (withdrawn from the scorecard).

• challenger : BAgent

  Who issues the challenge

• proposition : BProp W

  The proposition challenged

def Theories.Pragmatics.Assertion.Brandom.inferentialClosure {W : Type u_1} (cs : Core.Discourse.Commitment.CommitmentSlate W) (rules : List (BProp W × BProp W)) : Core.Discourse.Commitment.CommitmentSlate W

Inferential closure: if committed to p and p→q, committed to q.

Brandom's "material inference" — the content of a concept is its inferential role, not its reference. An agent's commitments are closed under their acknowledged inferential connections.

TODO: full closure requires a fixpoint computation.

Equations

• One or more equations did not get rendered due to their size.

theorem Theories.Pragmatics.Assertion.Brandom.scorekeepers_can_disagree : ∃ (sc : Scorecard Unit), (sc.card BAgent.speaker BAgent.addressee).commitments.commitments.length ≠ (sc.card BAgent.addressee BAgent.addressee).commitments.commitments.length

Scorekeepers can disagree: agent A's view of B's status can differ from agent C's view of B's status.

Witnessed by a scorecard where the speaker attributes a commitment to the addressee, but the addressee does not self-attribute it.