Reflexive pronouns #
A reflexive pronoun is a pronoun whose kind fixes its binding class: it is an anaphor, bound in its local domain. Some reflexives, as Japanese zibun and Icelandic sig, also take an antecedent outside that domain; what licenses the distant antecedent is a matter of analysis and is not recorded on the entry.
Main definitions #
ReflexivePronoun: a pronoun of the reflexive kind.ReflexivePronoun.paradigm: the forms an inventory offers for each category its person and number realize.ReflexivePronoun.toWord: its token, marked reflexive.
Main statements #
ReflexivePronoun.bindingClassOf_toWord: the token of a reflexive classifies as a reflexive anaphor.
References #
@[instance_reducible]
Equations
- instDecidableEqReflexivePronoun.decEq { toPronoun := a } { toPronoun := b } = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[instance_reducible]
Equations
- instReprReflexivePronoun = { reprPrec := instReprReflexivePronoun.repr }
The paradigm of an inventory assigns each category the forms of the reflexives whose person and number realize it. A reflexive denotes what its antecedent does, so its cells are those of its agreement features.
Equations
- ReflexivePronoun.paradigm = Morphology.formsAt (fun (x : ReflexivePronoun) => x.categories) fun (x : ReflexivePronoun) => x.form
Instances For
theorem
ReflexivePronoun.mem_paradigm
{I : Finset ReflexivePronoun}
{c : Person.Category}
{f : String}
:
f ∈ paradigm I c ↔ ∃ p ∈ I, c ∈ p.categories ∧ p.form = f
A reflexive's token is of UD pronoun type Prs and marked reflexive.
Equations
- p.toWord = p.toWord (some UD.PronType.Prs) true
Instances For
@[simp]
A reflexive pronoun is a reflexive anaphor.