Docs / Logic / Natural / Relation

The seven relations of natural logic

import Linglib.Logic.Natural.Relation · namespace NaturalLogic

MacCartney and Manning relate denotations by equivalence ≡, forward and reverse entailment ⊑ and ⊒, negation ^, alternation |, cover ⌣ and independence #. Following Icard, each relation is a conjunction of atomic lattice constraints, x ≤ y, y ≤ x, disjointness and codisjointness, so that ≡ also satisfies ⊑ and the relations are ordered by implication; MacCartney and Manning's mutually exclusive relations are their strict versions. The join R ⋈ S, the strongest relation that R followed by S guarantees, makes the relations a monoid, and it is sound over distributive lattices.

References

Declarations

L29–47

The seven relations

L51–68
L72–83
L85–96
L98
L100–105
L107–114
L126–139
L145–155
L165–174

Lattice content of the relations

L195–208
L210–217
L219–224
L226–233
L235–241
L243–254
L256–268
L270–280

Join soundness

L284–297

Chained relations compose as the join says, constraint by constraint.

theorem Relation.Holds.joinL299–305
{β : Type u_1} [DistribLattice β] [BoundedOrder β] {R S : Relation} {x y z : β} (hR : R.Holds x y) (hS : S.Holds y z) :
(R * S).Holds x z

Built from ,