Docs / Morphology / Exponence / DomainRule

Domain rules

import Linglib.Morphology.Exponence.DomainRule · namespace Morphology

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

References

Declarations

A domain rule carries an exponent and applies exactly at the contexts of a finite domain.

structure DomainRuleL43–50
(Ctx : Type u_1) (E : Type u_2) :
Type (max u_1 u_2)
  • dom : Finset Ctx

    The domain is the finite set of contexts the rule applies at.

  • exponent : E

    The exponent is what the rule assigns.

Derives DecidableEq.

Used by DomainRule.instExponenceRule, DomainRule.applies_iff, DomainRule.rule_exponent, DomainRule.coe_dom, DomainRule.factorsThrough_applies_iff, DomainRule.isChain_of_nested, DomainRule.instDecidableFactorsThroughAppliesOfFintypeOfDecidableEq, DomainRule.exists_not_isContiguous_realizeMinimal

Used in ODonnell2015, Stump2006

L58

Rules whose overlapping domains are nested satisfy Pāṇinian Determinism, their Elsewhere winners at any context forming a chain.

theorem DomainRule.isChain_of_nestedL70–76
{Ctx : Type u_1} {E : Type u_2} {v : RuleSet (DomainRule Ctx E)} (h : ∀ r ∈ v, ∀ s ∈ v, ¬Disjoint r.dom s.dom → r.dom ⊆ s.dom ∨ s.dom ⊆ r.dom) (c : Ctx) :
IsChain (fun (r s : DomainRule Ctx E) => r.dom ⊆ s.dom) {r : DomainRule Ctx E | v.IsElsewhereWinner (fun (x : DomainRule Ctx E) => x.dom) c r}

Built from

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.

theorem DomainRule.exists_not_isContiguous_realizeMinimalL87–104
:
∃ (v : RuleSet (DomainRule (Finset (Fin 3)) String)), v.Antihomophonous ∧ (∀ r ∈ v, IsUpperSet ↑r.dom) ∧ ¬IsContiguous (v.realizeMinimal fun (x : DomainRule (Finset (Fin 3)) String) => x.dom)

Built from