Docs / Studies / Studies.SchwarzWagner2026

Resolving Symmetry without Constraining Alternatives

Schwarz, B. & Wagner, M. (2026). Semantics and Pragmatics, 19(8)

Katzir and Fox let an implicature negate only alternatives no more complex than the assertion. Schwarz and Wagner let it negate anything and constrain the output: a strengthening is blocked when it entails a simplex meaning stronger than the assertion, so the assertion must be a strongest simplex meaning it entails. The two constraints are the conjuncts of Sauerland's secondary implicature, and blocking is Katzir's own principle read at the strengthened meaning. The examples are corners of a square of opposition, differing in which corners are lexical: blocking misjudges only (76b), the filter with a stalemate four rows. Blocking also rules out free choice, which the paper does not discuss.

Implementation notes

  • The paper's Excl is free, so it carries no information: every satisfiable strengthening is one, and what the constraint reads is the output s and the set F of simplex meanings. Trees enter only through F (simplex). The paper's (5) negates all of Excl, exh only what the assertion does not entail; they differ only on contradictions.
  • Blocked is a lowerClosure rather than NeoGricean.primaryImplicatures, its complement, because the paper declines to choose between Gricean and grammatical strengthening.
  • One grammar covers the examples. Its clauses compose by Functional Application in the reader of worlds, to the hub's determiners at a restrictor and a predicate's extension in each world, the square sqAt. Permitted, required and optional are those determiners over the deontic alternatives, parallel to some, all and not all on the paper's own account of (52). A Case is a prejacent with its lexicon, and each lexicon lists only the words the paper's discussion of that example uses.
  • optional is the O corner, not strictly symmetric with required, as the paper argues from (54) and (55). On the I \ A of Swanson 2010, both readings of (52) are blocked and both continuations in (54) are contradictory, where at the O corner only (54b) is. Katzir's (21), the target of Swanson 2010, survives (52) on this entry, though the paper groups it with CF: it reads only strictly stronger alternatives, and A is the only such corner. Only the filter with a stalemate stays refuted.
  • Complexity is the paper's plain notion, with lexical items as the source: blocking needs none of Katzir's contextual sources, and this one bounds size (atMostAsComplex.numNodes_le).
  • What is not simplex comes from a table of what each category can denote (meanings_mem_of_licensed), not from listing the trees.

TODO

The contextual cases (23), (58), (59), the disjunction (29), the embedding (79), the question effects (61)–(65) and the triples of footnote 17 are not rows; recoverability is not modelled. Bar-Lev et al. 2025 derive blocking's effects from fatal competition and partition by exhaustification against the 2024 manuscript's equivalence version, and that comparison needs a theory of questions here.

References

The blocking constraint

L90–92
L94–96

Blocking and its precursors

A strengthening is unblocked when the assertion is a strongest simplex meaning it entails: the "maximize basic meaning" of Section 1.3 is Maximize Presupposition read at the strengthened meaning.

theorem minimalFor_iff_not_blockedL107–117
{W : Type u_1} {s : Set W} {S : Type u_2} {alts : S → Set S} {content : S → Set W} {φ : S} :
MinimalFor (fun (x : S) => x ∈ insert φ (alts φ) ∩ content ⁻¹' Set.Ici s) content φ ↔ s ⊆ content φ ∧ ¬Blocked (content '' alts φ) s (content φ)

Built from

L137–139

Blocking is Katzir's conversational principle (21) with weak assertability read at the strengthened meaning.

theorem blocked_iff_katzir_blockedL182–193

Built from

Free choice

Blocking rules out free choice, however derived, since it reads only the output: You may have x is simpler than You may have x or y, strictly stronger, and entailed by the free-choice reading. One round of innocent exclusion is never blocked (exhIE_notMem_lowerClosure); the second round of Fox 2007's recursion is.

theorem blocked_freeChoiceL205–216
{W : Type u_1} {α : Type u_2} [Lattice α] {O : α → Set W} {x y : α} {F : Set (Set W)} (hF : O x ∈ F) (hO : Monotone O) (hab : O (x ⊔ y) ⊆ O x ∪ O y) (hx : (O x \ O y).Nonempty) (hy : (O y \ O x).Nonempty) (hfc : ((O x ∩ O y) \ O (x ⊓ y)).Nonempty) :
Blocked F (Fox2007.exhIter (Fox2007.sauerlandAlt O x y) 2 (O (x ⊔ y))) (O (x ⊔ y))

Built from

L219–233

Blocking on a square of opposition

The examples

L338–344
L346–350
L365–377
L433–437
L439–444
L499–521
L525–556
L571–599

The judgments

Blocking misjudges only (76b), as the paper says.

theorem blocked_misjudges_iffL796–806
{E W : Type} {A : Set E} {X : W → Set E} (h : Aristotelian.SquareRelations (sqAt A X)) (hne : ∀ (t : Aristotelian.Triangle), (sqAt A X).triangle t ≠ ⊥) (r : Row) :
r ∈ rows → (¬(¬Blocked (simplex A X r.case) ((squareOf (sqAt A X) r.case).I \ excl (sqAt A X) r.case r.excluded) (squareOf (sqAt A X) r.case).I ↔ r.available = true) ↔ r.case = Case.minimal ∧ r.excluded = Excluded.symmetric)

Built from , , , , , ,