Docs / Semantics / Exhaustification / Symmetric

Symmetric alternatives

import Linglib.Semantics.Exhaustification.Symmetric · namespace Exhaustification

Two alternatives are symmetric for an assertion when they partition it: negating either one asserts the other, so no theory that strengthens an assertion by negating alternatives can negate one of them without the other. This is the configuration of Kroch 1972's symmetry problem for scalar implicature, and Fox & Katzir 2011's definition of it. The file defines IsSymmetric, shows that the second symmetric alternative is the assertion without the first, that symmetric alternatives are complements below the assertion (isSymmetric_iff_isCompl), and that a set of propositions closed under negation and conjunction, a BooleanSubalgebra, contains both or neither.

References

Declarations

s₁ and s₂ are symmetric alternatives of s: they partition it.

structure IsSymmetricL33–36
{W : Type u_1} (s s₁ s₂ : Set W) :
  • union : s₁ ∪ s₂ = s
  • disjoint : Disjoint s₁ s₂

Used by isSymmetric_sdiff, isSymmetric_iff_isCompl, IsSymmetric.symm, IsSymmetric.subset_left, IsSymmetric.subset_right, IsSymmetric.sdiff_eq, IsSymmetric.not_subset_left, IsSymmetric.ssubset_left, IsSymmetric.mem_of_mem, isSymmetric_coe

Used in BrehenyEtAl2018, FoxKatzir2011, Katzir2007, SchwarzWagner2026, TrinhHaida2015

L38–39
L56
L58
L60–62
L64–65
L67–68
L70–72
L76–84