Docs / Morphology / Exponence / SubsetRule

Rules of the Subset Principle

import Linglib.Morphology.Exponence.SubsetRule · namespace Morphology

A rule specified for a bundle of features applies in the contexts extending its bundle, the first clause of the Subset Principle, so that where it applies is the principal filter of its bundle. Bundles live in any ordered type: a privative decomposition of a paradigm is a map into Finset K, and of a multidimensional paradigm a map into a product of such orders. Competition selects on a score strictly monotone in the specification, Halle's greatest number of features being the grade. Any such score selects an Elsewhere winner, so counting refines Kiparsky's inclusion of contexts. Over a meet-semilattice with a least element, a triple $x, y, z$ escapes ABA under every antihomophonous rule set exactly when $x \sqcap z \le y$ and $y$ lies below $x$ or $z$: $y$ sits on the path from $x$ down to $x \sqcap z$ and up to $z$.

References

Declarations

L28–45
L49–56

A score strictly monotone in the specification selects an Elsewhere winner, so that counting features (Halle 1997) refines the inclusion of contexts (Kiparsky 1973). It decides between incomparable specifications as well, which is where the two come apart.

theorem SubsetRule.realize_realizesL91–96
{P : Type u_1} {E : Type u_2} [Preorder P] [DecidableLE P] {α : Type u_3} [LinearOrder α] {g : P → α} {v : RuleSet (SubsetRule P E)} {c : P} {φ : E} (hg : StrictMono g) (h : v.realize (g ∘ features) c = some φ) :

Built from

L110–112
L117–122

The ABA characterization. Under a score strictly monotone in the specification, a triple escapes ABA under every antihomophonous rule set exactly when its middle takes in what the outer two share and lies below one of them. Failing the first, a rule for x ⊓ z beside an elsewhere rule realizes ABA; failing the second, a rule for y itself does, as a rule for the accusative features does under No Case Containment (Christopoulos & Zompì 2023).

theorem SubsetRule.forall_realize_eq_iffL141–166
{P : Type u_1} {E : Type u_2} [SemilatticeInf P] {x y z : P} [DecidableLE P] {α : Type u_3} [LinearOrder α] [OrderBot P] {g : P → α} [Nontrivial E] (hg : StrictMono g) :
(∀ (v : RuleSet (SubsetRule P E)), v.Antihomophonous → v.realize (g ∘ features) x = v.realize (g ∘ features) z → v.realize (g ∘ features) x = v.realize (g ∘ features) y) ↔ x ⊓ z ≤ y ∧ (y ≤ x ∨ y ≤ z)

Built from

L176–184
L190–194