Coon & Keine 2021 — Feature Gluttony [CK21] #
[CK21] (LI 52(4)): hierarchy effects — PCC, dative-nominative restrictions, copula effects — do not come from failed Agree or failed nominal licensing, but from feature gluttony: a single probe entering more than one Agree dependency. Agree (their (14)) is segment-based ([BR09]'s articulated probes): each segment [uF] independently agrees with the closest accessible DP bearing [F], copying that DP's whole geometry (coarse copying; not Multiple Agree — each segment agrees with at most one DP, their fn. 10). Probing is obligatory but failure-tolerant ([Pre14]).
Gluttony — distinct segments agreeing with distinct DPs (their
(15)–(16)) — arises only in inverse configurations: when the lower
DP bears probe-relevant segments the higher DP lacks
(gluttonous_only_inverse). It is not itself fatal; for
clitic-doubling probes, their (30) (every segment-agreed DP must
cliticize onto the host) is jointly unsatisfiable under gluttony
(cliticizing one-at-a-time violates (30) mid-derivation; cliticizing
simultaneously violates binary Merge) — that argument is carried in
prose; pccViolation states its upshot, gluttony itself.
PCC typology from probe articulation (their (39)) #
- Weak (
weakProbe, Catalan (22)–(32)): *3>[PART]. - Ultrastrong (
ultrastrongProbe): additionally *2>1. - Me-First (
meFirstProbe, missing intermediate segment — their fn. 22 flags this as non-innocuous): the probe derives *{2,3}>1; their table 1 describes Me-First as *1/2/3>1 — the 1>1 cell is where description and mechanism part ways (cf. their fn. 22's alternative treatment of Me-First as clitic ordering). - Strong (Basque (35)–(38)): weak probe + K-opaque datives (datives expose only [PERS], their §3.4.1) — or the branching probe of their fn. 22 (i) with φ-transparent datives.
Universal predictions (§3.4.2): no probe bans [PART]>3 or 3>3
(direct_never_banned — the geometry makes such gluttony
impossible); for [uPERS]-rooted probes a [PART]>[PART] ban entails a
3>[PART] ban (ban_part_part_implies_ban_three_part, bundled as
Probe.Articulated.ban_part_part); a single-segment probe never
gluttons (not_gluttonous_single_segment, their fn. 21). The
articulation laws themselves — downward closure along the geometry,
the (40) probe-specification hierarchy — live in the Probe
articulation section below (IsArticulated, Probe.Articulated,
Probe.Stage); meFirstProbe_not_articulated is their fn. 22 made
formal.
Rival accounts (their §2, comparisons drawn by the paper) #
- Against PLC/licensing accounts ([BR03]): hierarchy
effects track the probe, not licensing needs — in probeless
environments (their (10), Basque nonfinite clauses) PCC vanishes;
a PLC with no probe to satisfy it predicts the opposite
(
probeless_divergence_from_plc; B&R's own F-licensing route is the escape their §4 provides, so the disagreement is over where the explanatory work happens). - Against [PZ18]'s P-Constraint (criticized in
their §2 as stipulating the licensing parameter): the gluttony
tables match
PConstraint.IsLicitexactly for the weak and strong grammars, and diverge on one cell each for ultrastrong (2>2) and me-first (1>1) —*_matches_pConstraint/*_diverges_from_pConstraint.
Segments are CyclicAgree.Segment — the same inventory, since both
formalizations descend from [BR09]. ckSpec follows
their (11), where SPKR and ADDR are sister leaves in one geometry
(2nd person always bears ADDR); it differs from
CyclicAgree.personSpec .standard only there
(ckSpec_filter_eq_personSpec), and is grounded in
decomposePerson (ckSpec_grounded).
Gluttony and agreement (§4) #
For agreement (vs. clitics) the crash is at PF: each acquired value
demands a Vocabulary item; only one can be inserted; syncretic
demands rescue gluttony. icelandic_dat_nom derives the DAT-NOM
person restriction (their (75)) with the (84) syncretism fix and the
fully-syncretic singular; german_copula derives the
assumed-identity restriction (their (51)) with the past-tense war
fix (their fn. 32). not_gluttonous_singleton is their (86):
many probes on one DP is never gluttony.
Number, reverse PCC, repairs (§3.4.3–§3.5, (40)–(42)) #
The segment-generic core (GluttonousOn) instantiates at the number
geometry (their (12)): no_number_case_constraint derives the
missing "Number Case Constraint" — π's clitic doubling starves #'s
search space in ditransitives — against German copula number
gluttony (*SG>PL), where nothing doubles.
reverse_pcc_diagnoses_strong is their fn. 26: Slovenian's
order-flipping Strong PCC is derivable by the branching probe but
not by K-opacity. repairs_shield_goals covers the §3.5 repairs:
PP/FP encapsulation, y-cliticization, and Basque absolutive
displacement all shrink the probe's search space below two.
Probe articulation (relocated from Minimalist/Phi/Articulation.lean) #
The φ-feature geometry ([HR02]; [CK21]'s
(11)) is a partial order on CyclicAgree.Segment: [π] is bottom and
[speaker]/[addressee] are the maximal leaves, with s ≤ t read as
"bearing t entails bearing s". Two laws of probe systems then
become order theory:
- Articulation ([BR09]; [CK21] (13)): a
probe's segments are downward-closed along the geometry —
IsArticulated, equivalent to mathlib'sIsLowerSet(isArticulated_iff_isLowerSet). Goal specifications are also lower sets (personSpec_isArticulated): that is the geometric containment (author ⊂ participant ⊂ π) as order theory. [CK21]'s fn. 22 flags probes with missing intermediate segments (their Me-First probe) as non-innocuous — here, they are exactly the non-lower-set probes.Probe.Articulatedbundles the laws. - The probe-specification hierarchy ([CK21] (40)):
[uφ] → [uπ] → [uπ ▷ u#] → [uπ ▷ u# ▷ uΓ].Probe.Stagecarries the hierarchy as a type: a number probe without a person probe is unrepresentable, which is how the account derives the missing "Number Case Constraint" (seeno_number_case_constraintbelow).
Main declarations:
Segment.below, thePartialOrder Segmentinstance — the geometry.IsArticulated— downward-closure of a segment list; decidable.Probe.Articulated— segments + rootedness in [π] + closure.Probe.Stage— the (40) hierarchy, withnumber_requires_person/gender_requires_numberas theorems.
The segment order #
Equations
- One or more equations did not get rendered due to their size.
The downward closure of a single segment in the geometry
([CK21] (11)): everything bearing this segment also
bears these. Declared in Segment's own namespace so dot notation
(t.below) resolves — Segment is Minimalist.CyclicAgree.Segment.
Equations
- Minimalist.CyclicAgree.Segment.pi.below = [Minimalist.CyclicAgree.Segment.pi]
- Minimalist.CyclicAgree.Segment.participant.below = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant]
- Minimalist.CyclicAgree.Segment.speaker.below = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant, Minimalist.CyclicAgree.Segment.speaker]
- Minimalist.CyclicAgree.Segment.addressee.below = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant, Minimalist.CyclicAgree.Segment.addressee]
Instances For
The entailment order: s ≤ t iff bearing t entails bearing
s. [π] is bottom; [speaker] and [addressee] are incomparable
maximal leaves.
Equations
- One or more equations did not get rendered due to their size.
Equations
- CoonKeine2021.instDecidableRelSegmentLe s t = List.instDecidableMemOfLawfulBEq s t.below
Equations
Articulation as downward closure #
A segment list is articulated iff it is downward-closed along the geometry ([BR09]'s articulated probes; [CK21] (13)). Goal specifications are articulated too — geometric containment and probe articulation are the same order-theoretic fact.
Equations
- CoonKeine2021.IsArticulated P = ∀ s ∈ P, ∀ t ≤ s, t ∈ P
Instances For
Articulation is mathlib's IsLowerSet, on the membership set.
Person specifications are articulated, for both geometries: the [HR02] containment as a lower-set fact.
[BR09]'s named probes are all articulated.
A bundled articulated probe: segments rooted in [uπ] (every
probe of [CK21]'s (13)/(39) contains [uPERS]) and
downward-closed along the geometry. Probes with missing
intermediate segments — [CK21]'s Me-First (39c),
flagged in their fn. 22 — fail lower and cannot be bundled.
- segments : Minimalist.Probe.Articulation
- rooted : Minimalist.CyclicAgree.Segment.pi ∈ self.segments
- lower : IsArticulated self.segments
Instances For
The family of search-level Probes an articulated probe denotes,
given a bearing relation for the goal type: one probe per
segment ([BR09]; [CK21] (14)). An
articulated probe is a specification; this is its canonical
map into the Probe carrier — one-to-many, which is why the
relationship is denotation, not extension.
Equations
- P.toProbes bears = List.map (fun (s : Minimalist.CyclicAgree.Segment) => Minimalist.Probe.ofVis (bears s)) P.segments
Instances For
An articulated probe's behaviour is the cascade of its segment probes.
Cascading the denoted segment probes (toProbes) reduces to a segment-ordered
search: the first segment in articulation order that bears some goal delivers
that goal ([BR09]; [CK21] (14)). This connects the
bundled specification (Probe.Articulated) to the substrate cascade semantics
(Probe.cascade).
The (40) hierarchy as a type:
[uφ] → [uπ] → [uπ ▷ u#] → [uπ ▷ u# ▷ uΓ]. A φ-probe system is
one of these four stages; unattested inventories — a number probe
without a person probe, a gender probe without a number probe —
are unrepresentable. The universal ordering (π probes before #,
before Γ) is carried by the stage itself. #
- unsplit : Stage
A single unsplit [uφ] probe.
- personOnly : Stage
A person probe only.
- personNumber : Stage
Person and number probes, π ▷ #.
- personNumberGender : Stage
Person, number, and gender probes, π ▷ # ▷ Γ.
Instances For
Equations
- CoonKeine2021.Probe.instDecidableEqStage x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- CoonKeine2021.Probe.instReprStage = { reprPrec := CoonKeine2021.Probe.instReprStage.repr }
Does the stage have a dedicated person probe?
Equations
- CoonKeine2021.Probe.Stage.unsplit.hasPersonProbe = false
- x✝.hasPersonProbe = true
Instances For
Does the stage have a number probe?
Equations
Instances For
Does the stage have a gender probe?
Equations
- CoonKeine2021.Probe.Stage.personNumberGender.hasGenderProbe = true
- x✝.hasGenderProbe = false
Instances For
(40), first law: a number probe entails a person probe.
(40), second law: a gender probe entails a number probe.
Feature geometry and goals (their (11), §3.4.1) #
Person geometry, their (11): [PERS [PART [SPKR][ADDR]]] — 1st is
[PERS, PART, SPKR], 2nd is [PERS, PART, ADDR], 3rd is bare
[PERS]. Segments are [BR09]'s
(CyclicAgree.Segment); deviates from
CyclicAgree.personSpec .standard only in 2nd person's ADDR
leaf.
Equations
- CoonKeine2021.ckSpec Person.first = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant, Minimalist.CyclicAgree.Segment.speaker]
- CoonKeine2021.ckSpec Person.firstInclusive = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant, Minimalist.CyclicAgree.Segment.speaker]
- CoonKeine2021.ckSpec Person.firstExclusive = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant, Minimalist.CyclicAgree.Segment.speaker]
- CoonKeine2021.ckSpec Person.second = [Minimalist.CyclicAgree.Segment.pi, Minimalist.CyclicAgree.Segment.participant, Minimalist.CyclicAgree.Segment.addressee]
- CoonKeine2021.ckSpec Person.third = [Minimalist.CyclicAgree.Segment.pi]
- CoonKeine2021.ckSpec Person.zero = [Minimalist.CyclicAgree.Segment.pi]
Instances For
ckSpec is grounded in the [HR02] decomposition:
PART and SPKR membership match decomposePerson.
Forgetting the ADDR leaf recovers personSpec .standard.
A goal DP: its person and number, and whether it is encapsulated under a K(ase) shell (their §3.4.1: Basque datives are formally 3rd person — only [PERS] is visible from outside).
- person : Person
- kOpaque : Bool
- plural : Bool
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- CoonKeine2021.instReprGoal = { reprPrec := CoonKeine2021.instReprGoal.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
A K-opaque (dative) goal DP.
Equations
- CoonKeine2021.dat p = { person := p, kOpaque := true }
Instances For
A φ-transparent plural goal DP.
Equations
- CoonKeine2021.dpPl p = { person := p, plural := true }
Instances For
The person segments a goal exposes to outside probing.
Equations
- g.visibleSegs = if g.kOpaque = true then [Minimalist.CyclicAgree.Segment.pi] else CoonKeine2021.ckSpec g.person
Instances For
Probes and segment-based Agree (their (13), (14), (39)) #
Their (39a): [uPERS [uPART]] — Weak PCC (Catalan). Identical to
[BR09]'s partial probe (CyclicAgree.partialProbe),
by construction.
Instances For
Their (39b): [uPERS [uPART [uSPKR]]] — Ultrastrong PCC.
Identical to [BR09]'s full probe under the standard
geometry (CyclicAgree.fullProbeStd).
Instances For
Their (39c): [uPERS [uSPKR]] — Me-First PCC (missing intermediate segment; see their fn. 22).
Equations
Instances For
Their fn. 22 (i): [uPERS [uPART [uSPKR][uADDR]]] — Strong PCC with φ-transparent datives.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Agree, their (14), generic in the segment type ((11) person,
(12) number): a segment agrees with the closest accessible goal
bearing it — Probe.search over position-indexed tokens (two
same-φ arguments remain distinct agreed-with tokens).
Equations
- CoonKeine2021.segGoalOn bears s goals = (Minimalist.Probe.ofVis fun (t : CoonKeine2021.Goal × ℕ) => bears s t.1).search goals.zipIdx
Instances For
Feature gluttony (their (15)–(16)), generic in the segment type: two segments of one probe agree with distinct DPs. Not itself fatal; the crash comes from downstream resolution (their (30) for clitics, syncretism for agreement).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- CoonKeine2021.instDecidableGluttonousOn bears P goals = id inferInstance
Person-segment visibility: the segment is in the goal's exposed geometry.
Equations
- CoonKeine2021.personBears s g = decide (s ∈ g.visibleSegs)
Instances For
Agree for the person probe (their (14) over the (11) geometry).
Equations
- CoonKeine2021.segGoal s goals = CoonKeine2021.segGoalOn CoonKeine2021.personBears s goals
Instances For
Person-probe gluttony.
Equations
- CoonKeine2021.Gluttonous P goals = CoonKeine2021.GluttonousOn CoonKeine2021.personBears P goals
Instances For
Equations
Gluttony is limited to inverse configurations #
Their "general consequence" (after (20)): gluttony arises only in inverse configurations. If every segment the lower goal exposes is also borne by the higher goal, no probe is gluttonous over them — direct (17)–(18) and balanced (19)–(20) configurations are safe.
The PCC tables, derived (their §3.3–3.4) #
The PCC configuration: a clitic-doubling probe over IO > DO. By their (30), every segment-agreed DP must cliticize onto the host; under gluttony this is jointly unsatisfiable (one-at-a-time violates (30) mid-derivation, simultaneous violates binary Merge), so gluttony here IS the predicted ban.
Equations
- CoonKeine2021.pccViolation P ioOpaque io do_ = CoonKeine2021.Gluttonous P [{ person := io, kOpaque := ioOpaque }, CoonKeine2021.dp do_]
Instances For
Equations
- CoonKeine2021.instDecidablePccViolation P b io do_ = CoonKeine2021.instDecidablePccViolation._aux_1 P b io do_
The 1/2/3 grid the PCC literature states its varieties over.
Equations
Instances For
Weak PCC (their (22), Catalan (24)/(28)/(31)): exactly *3>[PART].
Ultrastrong PCC (their (39b)): *3>[PART] and *2>1.
What the Me-First probe (39c) derives: *{2,3}>1. (Their table 1 describes Me-First as *X>1 for all X; the 1>1 cell is underivable by gluttony — their fn. 22 discusses alternatives.)
Strong PCC via K-opaque datives (their (35)–(36), Basque): with the dative exposing only [PERS], the weak probe bans every [PART] direct object — *X>[PART] for all X.
Strong PCC via the branching probe (their fn. 22 (i)), datives φ-transparent: bans every distinct-person cluster with a [PART] direct object. Unlike K-opacity, same-person clusters (1>1, 2>2) are not gluttonous — the second leaf segment finds no second goal — but those are independently unattestable in clitic clusters (binding).
Their (37a/b) Basque contrast: a DAT>ABS experiencer configuration is gluttonous (*3DAT>1ABS), but the ABS>DAT order of motion verbs is not — with opaque datives, reversing the order removes the inversion.
Universal predictions (their §3.4.2) #
No probe whatsoever bans a direct ([PART]>3) or balanced (3>3) configuration: the lower goal's bare [PERS] is contained in any goal's geometry, so gluttony is impossible — "the gluttony account therefore derives the fact that no such PCC pattern exists".
Their fn. 22, formal: the Me-First probe (39c) is not articulated
— [uSPKR] without [uPART] is not downward-closed along the
geometry (IsArticulated, Probe articulation section above). The
branching Strong probe of fn. 22 (i) is.
Their fn. 21: a single-segment (unarticulated) probe never gluttons — a language whose object probe is bare [uφ] is predicted to lack PCC effects altogether.
For [uPERS]-rooted probes, banning [PART]>[PART] entails banning 3>[PART] (their §3.4.2 implicational universal, instantiated at 2>1 ⇒ 3>1): the only segment a 1st-person DO can win against a 2nd-person IO is [uSPKR], and it wins against a 3rd-person IO a fortiori, while [uPERS] still lands on the IO. (Rootedness — the one property every probe of their (13)/(39) has — suffices; full downward closure is not needed.)
The bundled form: an Probe.Articulated (Probe articulation
section above) carries [uPERS]-rootedness as a law, so the
implicational universal needs no side condition.
Rival accounts (their §2) #
Probeless environments (their (10): Basque nonfinite clauses lose
the PCC): no probe, no gluttony — the configuration is predicted
grammatical. A bare PLC with no Agree cycle available
([BR03] as formalized in BejarRezac2003.PLCOk)
deems an unembedded participant unlicensed in the same
environment. (B&R's F-licensing route is their escape — the
disagreement is over whether hierarchy effects track licensing
needs or the probe.)
Gluttony reproduces [PZ18]'s weak and strong grammars cell-for-cell over the 1/2/3 grid.
Where the two formal systems part ways, ultrastrong half: P-Constraint's ultrastrong grammar additionally rules out 2>2 (P-Uniqueness with no [+author] rescue), which gluttony permits (a 2nd-person IO fully matches the probe). All other cells agree.
Me-first half: P-Constraint's me-first grammar rules out 1>1, which gluttony permits (the probe's [uSPKR] is matched by the IO) — the same cell where the probe (39c) departs from the descriptive *X>1 statement. All other cells agree.
Gluttony and agreement: values, Vocabulary, syncretism (§4) #
For morphological agreement (vs. clitics), gluttony is fatal only at
PF: the probe carries one value per agreed goal (their (16)/(58)),
each value demands a Vocabulary item (the most specific compatible
one — the Elsewhere Condition, as in VocabSimple.bestMatch), and
only one VI can be inserted. Conflicting demands → ineffability
(their (83)); syncretic demands → grammatical despite gluttony
(their (85)) — the signature prediction separating this account from
licensing: "gluttony and gluttonous probes do not by themselves give
rise to ungrammaticality". The VI type is study-local because its
context slot is the number value, not a syntactic category
(VocabSimple.VocabEntry's context : Option Cat does not fit).
Scope: person effects only. The German number hierarchy (*SG>PL,
their (52)/(64)) and Icelandic number effects (their fn. 35) need
number segments, which the person-only Segment inventory lacks —
deferred with the paper's own caveat that the Icelandic number facts
are interspeaker-variable.
The values a probe acquires: the visible geometry of each distinct goal token some segment agreed with (their (16)).
Equations
- One or more equations did not get rendered due to their size.
Instances For
One DP agreeing with many probes is not gluttony (their (86): Icelandic multiple participle agreement): a single goal can never yield two distinct tokens.
A Vocabulary item for a verbal agreement slot (their (82)): a
person specification ([] = underspecified, compatible with any
value), a contextual number specification, and the exponent.
- personSpec : List Minimalist.CyclicAgree.Segment
- pluralCtx : Bool
- exponent : String
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- CoonKeine2021.instReprVI = { reprPrec := CoonKeine2021.instReprVI.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
The VI a single person value demands in a number context: the
most specific compatible item (Elsewhere Condition; ties by list
order, as in VocabSimple.bestMatch).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Morphological resolvability: all carried values demand the same VI — "it is possible to simultaneously satisfy both by inserting a single VI" (their (85)). A non-gluttonous probe (one value) is trivially resolvable; a gluttonous one is resolvable exactly under syncretism.
Equations
- CoonKeine2021.MorphOk vocab plural values = ∀ v₁ ∈ values, ∀ v₂ ∈ values, CoonKeine2021.demand vocab plural v₁ = CoonKeine2021.demand vocab plural v₂
Instances For
Equations
- CoonKeine2021.instDecidableMorphOk vocab plural values = CoonKeine2021.instDecidableMorphOk._aux_1 vocab plural values
Icelandic dative-nominative constructions (§4.2) #
The Icelandic past-tense mediopassive suffixes (their (81)/(82)): -ist (any person, singular), -ust (any person, plural), -umst (1st person, plural — more specific, so it wins for 1PL).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Icelandic DAT-NOM (their (75)–(85)): the dative is externally 3rd person (K-opaque), so π = [uPERS [uPART]] (their (79), = the weak probe) gluttons whenever the nominative is 1st/2nd. The fate of the structure is then decided by morphology:
- *3DAT > 1PL.NOM (their (76a)): the 3rd value demands -ust, the 1st value -umst — conflict (their (83)).
- 3DAT > 2PL.NOM (their (84a)): gluttonous, but both values demand -ust — syncretism rescues (their (85)). Gluttony is not by itself ungrammaticality.
- Singular nominatives: every cell of (81) is -ist, so the person restriction is "completely lifted in the singular".
German copula constructions (§4.1) #
German singular present-tense copula agreement: bin (1SG), bist (2SG), ist (elsewhere).
Equations
- One or more equations did not get rendered due to their size.
Instances For
German singular past-tense copula agreement: war is syncretic between 1SG and 3SG (their fn. 32); warst (2SG).
Equations
- One or more equations did not get rendered due to their size.
Instances For
German assumed-identity copulas (their (51)–(62)): both DPs are nominative, hence both visible to T's probe — gluttony in 3>[PART] (their (57)–(58)); in English the second DP is accusative and invisible, so no effect. The morphology then decides:
- *3 > 2 present (their (51b) Martin ist du): ist vs. bist — conflict.
- ?3 > 1 past (their fn. 32 (i) Martin war ich): war is 1SG/3SG-syncretic — resolvable, and the sentence improves.
- Nonfinite clauses (their (54)): no probe, no gluttony — same logic as the PCC's probeless environments.
The number probe and the missing "Number Case Constraint" #
((40)–(42), §3.4.3)
Their (40) probe-specification hierarchy — [uφ] → [uπ] → [uπ ▷ u#] → [uπ ▷ u# ▷ uΓ] — entails that a number probe is only ever present
alongside a person probe that probes first. Together with clitic
doubling removing the doubled DP (their §3.2), this derives the
absence of a "Number Case Constraint" in ditransitives: π doubles the
IO before # probes, so # sees a single goal and cannot glutton. In
German copulas there is no clitic doubling, so # sees both DPs —
number gluttony in SG>PL (their (52)/(64)/(67)). The PF side of the
German number effect (3SG ist vs. 3PL sind demands) mirrors the
person case and awaits a segment-generic VI layer.
Number geometry, their (12): singular = [NUM], plural = [NUM [PL]].
Instances For
Equations
- CoonKeine2021.instDecidableEqNumSeg x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- CoonKeine2021.instReprNumSeg.repr CoonKeine2021.NumSeg.num prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "CoonKeine2021.NumSeg.num")).group prec✝
- CoonKeine2021.instReprNumSeg.repr CoonKeine2021.NumSeg.pl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "CoonKeine2021.NumSeg.pl")).group prec✝
Instances For
Equations
- CoonKeine2021.instReprNumSeg = { reprPrec := CoonKeine2021.instReprNumSeg.repr }
The number segments a goal exposes.
Equations
- g.visibleNumSegs = if g.plural = true then [CoonKeine2021.NumSeg.num, CoonKeine2021.NumSeg.pl] else [CoonKeine2021.NumSeg.num]
Instances For
Number-segment visibility.
Equations
- CoonKeine2021.numBears s g = decide (s ∈ g.visibleNumSegs)
Instances For
The articulated number probe [uNUM [uPL]] (their (23)/(55)).
Instances For
Clitic doubling renders the doubled DP invisible to subsequent probing (their §3.2): the tokens π agreed with are removed from #'s search space (their (42)).
Equations
- One or more equations did not get rendered due to their size.
Instances For
No "Number Case Constraint" (their (40)–(42), Basque (41)): in a clitic-doubling ditransitive, π doubles the IO, removing it from #'s search space — # probes a singleton and cannot glutton, even with a more number-specified DO. In German copulas (their (67)), with no clitic doubling, # sees both DPs: *SG>PL gluttons (their (52)/(64)), PL>SG does not.
Reverse PCC (§3.4.4) #
The reverse PCC (their (44)–(45), after Stegovec's Slovenian)
and its fn. 26 diagnostic. Goal carries no case, so gluttony
tracks structural order alone: reordering the DO above the IO
flips which DP the person restriction targets — the reverse PCC
comes for free. Slovenian shows the Strong PCC in both orders,
which diagnoses the implementation: under K-opacity the reversed
order puts the opaque dative LOW, where its bare [PERS] cannot
out-specify the higher DP — no gluttony, hence no reverse
effect; the branching probe (fn. 22 (i)) with φ-transparent
datives keeps the ban symmetric. Slovenian's Strong PCC must
therefore be the branching probe, with the dative's φ-features
always visible.
PCC repairs (§3.5) #
An empty search space is never gluttonous.
The §3.5 repairs all shield a goal from the probe, leaving at
most one accessible DP — and a probe over at most one goal can
never glutton: French PP-realization of the IO (their (46)–(47);
the PP-encapsulation assumption is [BR03]'s, cf.
BejarRezac2003.pp_repair), Greek strong — FP-encapsulated —
object pronouns (their (48)–(49)), French locative-y
cliticization of the repaired PP, and Basque absolutive
displacement around π (their (50)). Last-resort uses of these
structures (Rezac's ᑬ) translate as: extra structure is
sanctioned iff the probe would otherwise glutton.