Docs / Phonology / Prosody / Structure / FirstOrder
Prosodic structures as first-order structures
import Linglib.Phonology.Prosody.Structure.FirstOrder · namespace Prosody.Structure
A prosodic structure is a relational model in the sense in which Jardine et al. 2021 compare theories of representation: a domain of nodes with binary relations of dominance and precedence and a unary relation for each label. This file gives the signature and reads a prosodic structure as a first-order structure over it, as mathlib reads a simple graph as a structure in the language of graphs. An isomorphism of prosodic structures is an equivalence of first-order structures, so ordered trees are equal when their models are equivalent.
References
- Jardine et al. 2021, A Formal Investigation of Q-Theory in Comparison to Autosegmental Representations
Declarations
The signature of prosodic structures with labels in α.
Built from
Used by firstOrder, Iso.toEquiv, Iso.ofEquiv, isoEquiv, nonempty_equiv_ofTree_iff
A prosodic structure is a first-order structure in the signature of dominance, precedence and labels.
The definition is too large to print here; read it in the source.
Built from
An equivalence of first-order structures is an isomorphism of prosodic structures.
- Iso.ofEquiv f = { toOrderIso := { toEquiv := f.toEquiv, map_rel_iff' := ⋯ }, precedes_iff := ⋯, label_comp := ⋯ }
Built from
Used by isoEquiv
The isomorphisms of prosodic structures are the equivalences of their first-order structures.
- isoEquiv = { toFun := Iso.toEquiv, invFun := Iso.ofEquiv, left_inv := ⋯, right_inv := ⋯ }
Built from , ,
Ordered trees whose models are equivalent are equal.
Built from