Docs / Syntax / Category / Pronoun / Basic

Pronouns

import Linglib.Syntax.Category.Pronoun.Basic

This file defines the pronoun as a lexical object: a surface form with the agreement features every pronoun kind shares. The kinds extend it, each in its own file: PersonalPronoun, LogophoricPronoun, ReflexivePronoun, ReciprocalPronoun, DemonstrativePronoun, InterrogativePronoun and IndefinitePronoun. A Pronoun has no denotation, pronoun type or binding class of its own; the kind supplies them, and Pronoun.toWord takes the last two as arguments.

Main definitions

Pronoun.Strength: the clitic, weak and strong classes of Cardinaletti and Starke, a bounded linear order by structural deficiency.
Pronoun: the form, person, number, cases and gender of a pronoun, with its script form and the strength class of its series.
Pronoun.case: the flat case of a pronoun, the meet of the cases it fills.
Pronoun.ofCells, Pronoun.ofTable: the pronoun of a form in a table of cells.
Pronoun.categories: the referential categories of Cysouw that the person and number realize.
Pronoun.WellFormed: clusivity is not borne by a singular.
Pronoun.toWord: the pronoun as a token, with the pronoun type and reflexive marking of its kind; Pronoun.phi_toWord says the token bears the pronoun's φ-features.
Pronoun.CandidateAntecedent: a nominal token that agrees with the pronoun, so one of the pronoun's number (Pronoun.CandidateAntecedent.number_eq).

Main results

Pronoun.bindingClassOf_toWord_reflex, Pronoun.bindingClassOf_toWord_rcp, Pronoun.bindingClassOf_toWord: the binding class the engine reads off a pronoun's token is fixed by the marking its kind supplies.

References

Structural deficiency

The three pronoun classes of Cardinaletti & Starke 1999, ordered by structural deficiency with the most deficient least. The classes are distributional: stress does not define them.

inductive Pronoun.Strength L62–74

Type

clitic : Strength
A clitic is a deficient head, adjacent to the verb, clustering and prosodically dependent, as Italian lo and French le.
weak : Strength
A weak pronoun is a deficient phrase, confined to derived positions and not coordinable, yet a prosodic word, as German es and Italian dative loro.
strong : Strength
A non-deficient phrase: coordinable, modifiable and free to stand in peripheral positions, as Italian and French lui.

Derives DecidableEq, Repr.

Used by Pronoun.Strength.toNat, Pronoun.Strength.instLinearOrder, Pronoun.Strength.instBoundedOrder, Pronoun

Used in Syntax/Category/Pronoun/Demonstrative, Syntax/Category/Pronoun/Indefinite, Syntax/Category/Pronoun/Interrogative, Syntax/Category/Pronoun/Logophoric, Syntax/Category/Pronoun/Personal and 3 more

The pronoun

A pronoun is a surface form with agreement features, the core every pronoun kind shares.

structure Pronoun L99–118

Type

form : String
The surface form, romanized or orthographic.
person : Option Person
The grammatical person. Clusivity is a person value: Tagalog tayo is firstInclusive and kami firstExclusive, English we plain first (Cysouw 2003).
number : Option Number
The grammatical number.
cases : Finset Case
The cases the form fills: one for most forms, several for a syncretic one such as English you, none where they are unrecorded.
gender : Option UD.Gender
The grammatical gender, none where the form marks none.
script : Option String
The form in its native script.
strength : Option Strength
The strength class of the series the form belongs to, none where it is unrecorded or the series has no stable class (Jung & Migdalski 2022).

Built from

Used by instDecidableEqPronoun, Pronoun.case, Pronoun.categories, Pronoun.phi, Pronoun.instHasPhi, Pronoun.WellFormed, Pronoun.instDecidableWellFormed, Pronoun.ofCells, Pronoun.ofTable, Pronoun.toWord, Pronoun.phi_toWord, Pronoun.bindingClassOf_toWord_reflex, Pronoun.bindingClassOf_toWord_rcp, Pronoun.bindingClassOf_toWord, Pronoun.CandidateAntecedent, Pronoun.instDecidableCandidateAntecedent, Pronoun.CandidateAntecedent.number_eq

Used in Syntax/Category/Pronoun/Demonstrative, Syntax/Category/Pronoun/Indefinite, Syntax/Category/Pronoun/Interrogative, Syntax/Category/Pronoun/Personal, Syntax/Category/Pronoun/Reciprocal and 4 more

L120

The flat case of a pronoun: the meet of the cases it fills, ⊥ for a syncretic form and for one whose cases are unrecorded.

def Pronoun.case L126–128

(p : Pronoun) :

Flat Case

p.case = Flat.finsetInf p.cases Flat.some

Built from

Used by Pronoun.phi, Pronoun.toWord

The referential categories of Cysouw 2003 that the person and number realize: none when either is unspecified, several for a syncretism such as clusivity-unmarked English we.

def Pronoun.categories L130–133

(p : Pronoun) :

Finset Person.Category

p.categories = (Option.map₂ Person.Category.ofPersonNumber p.person p.number).getD ∅

Built from

Used in Fragments/Tagalog/Pronouns, Syntax/Category/Pronoun/Personal, Syntax/Category/Pronoun/Reflexive, Harbour2016

L135–141

L143

Clusivity is not borne by a singular: the inclusive and exclusive persons split the first person non-singular (Cysouw 2003).

def Pronoun.WellFormed L145–148

(p : Pronoun) :

Prop

p.WellFormed = ∀ per ∈ p.person, per.MarksClusivity → p.number ≠ some Number.singular

Built from

Used by Pronoun.instDecidableWellFormed

Used in Fragments/Tagalog/Pronouns

L150–151

The pronouns of a table

L160–162

The pronoun f filling the cells s, where a cell has a person and may have a number, a gender and a case: the cases of the cells, the flat value of their person and gender, and the number their categories share, general for cells of both numbers.

def Pronoun.ofCells L164–172

{C : Type u_1} (person : C → Person) (number : C → Option Number) (gender : C → Option UD.Gender) (case : C → Option Case) (s : Finset C) (f : String) :

Pronoun

The definition is too large to print here; read it in the source.

Built from

Used by Pronoun.ofTable

Used in Syntax/Category/Pronoun/Personal

The pronoun f of a table, filling every cell the table gives it.

def Pronoun.ofTable L174–176

{C : Type u_1} (person : C → Person) (number : C → Option Number) (gender : C → Option UD.Gender) (case : C → Option Case) [Fintype C] (table : C → Finset String) (f : String) :

Pronoun

Pronoun.ofTable person number gender case table f = Pronoun.ofCells person number gender case (Morphology.formCellsOf table f) f

Built from ,

The pronoun as a token

The token of a pronoun is a PRON word with its agreement features, and with the pronoun type and reflexive marking its kind supplies.

def Pronoun.toWord L182–188

(p : Pronoun) (pronType : Option UD.PronType := none) (reflex : Option Unit := none) :

Morphology.Word

p.toWord pronType reflex = { form := p.form, cat := UD.UPOS.PRON, features := Morphology.Features.of p.person p.number p.gender none p.case none none pronType none none reflex }

Built from ,

Used by Pronoun.phi_toWord, Pronoun.bindingClassOf_toWord_reflex, Pronoun.bindingClassOf_toWord_rcp, Pronoun.bindingClassOf_toWord

The token of a pronoun bears the pronoun's φ-features, whatever its pronoun type and reflexive marking.

@[simp] theorem Pronoun.phi_toWord L190–194

(p : Pronoun) (pronType : Option UD.PronType) (reflex : Option Unit) :

HasPhi.phi (p.toWord pronType reflex) = HasPhi.phi p

Built from ,

A token marked reflexive classifies as a reflexive anaphor.

@[simp] theorem Pronoun.bindingClassOf_toWord_reflex L196–200

(p : Pronoun) (t : Option UD.PronType) :

Binding.bindingClassOf (p.toWord t (some ())) = some Binding.BindingClass.reflexive

Built from ,

A token of reciprocal pronoun type classifies as a reciprocal anaphor.

@[simp] theorem Pronoun.bindingClassOf_toWord_rcp L202–206

(p : Pronoun) :

Binding.bindingClassOf (p.toWord (some UD.PronType.Rcp)) = some Binding.BindingClass.reciprocal

Built from ,

Any other pronoun token classifies as a pronominal, the elsewhere class of Chomsky 1981.

theorem Pronoun.bindingClassOf_toWord L208–213

(p : Pronoun) {t : Option UD.PronType} (ht : t ≠ some UD.PronType.Rcp) :

Binding.bindingClassOf (p.toWord t) = some Binding.BindingClass.pronoun

Built from ,

A candidate antecedent of a pronoun is a nominal token that agrees with it: a pro-form takes its antecedents from a fixed form-class (Bloomfield 1933).

def Pronoun.CandidateAntecedent L215–218

(p : Pronoun) (w : Morphology.Word) :

Prop

p.CandidateAntecedent w = (Binding.IsNominal w.cat ∧ HasPhi.Agree p w)

Built from

Used by Pronoun.instDecidableCandidateAntecedent, Pronoun.CandidateAntecedent.number_eq

Used in Fragments/Turkish/Anaphors, KehlerRohde2013, RosaArnold2017

L220–221

A candidate antecedent has the pronoun's number, where both mark one.

theorem Pronoun.CandidateAntecedent.number_eq L224–227

{p : Pronoun} {w : Morphology.Word} (h : p.CandidateAntecedent w) {n m : Number} (hp : p.number = some n) (hw : w.features Morphology.Feature.number = some m) :

n = m

Built from ,