This file defines domain rules, rules of exponence that apply exactly at the contexts of a
finite domain, ordered by domain inclusion so that the rule with the narrower domain is the more
specific. O'Donnell's finitely supported rules, whose domain is the finite set of forms a rule
generates, and Stump's rules of paradigm linkage, whose domain is a set of content cells, are
domain rules.
Main definitions
DomainRule: a finite domain with an exponent, with its ExponenceRule instance;
its specificity key is the domain, ordered by inclusion.
Main results
DomainRule.le_iff, DomainRule.lt_iff: specificity is domain inclusion.
Without Pāṇinian Determinism, minimal selection realizes ABA. Over feature bundles ordered by
inclusion, a rule S for feature 1, a rule R for feature 0, and a rule T for features
1 and 2 each apply on an upper set, and listed in that order they realize R, S, R on the
chain {0} ⊆ {0, 1} ⊆ {0, 1, 2}: at {0, 1} the winners S and R are incomparable, and the
list order picks S.