Bruening 2025: selectional violations in coordination

Bruening replies to Patejuk and Przepiórkowski's critique of Bruening and Al Khalaf. He grants that coordinated arguments need not match in category, so the revised grammar keeps the 2020 selector's requirements, c-selection checked against every conjunct and S-features checked once against the conjunct next to the selector, without the requirement that conjuncts share a category (§§5.2–5.4). He maintains that the two selectional violations are real, limited and linear, as three surveys bear out, and replaces the 2020 account of the adverbial one by negative c-selectional features, which the next item merged checks off (§5.8). The examples are the rows of Data/Examples/Bruening2025 and the survey results are Data/Experiments/Bruening2025.

Main definitions

• Selected, Site: what the features name and what a coordination merges with.
• CFeature, Modifier: a modifier's category and c-selectional feature.
• MergesWith: when a coordination of modifiers can merge with its site.

Main results

• selection_rows: complements of one category and meaning differ in acceptability from verb to verb, so c-selection is not semantic selection.
• argument_rows, argument_rows_licensed, argument_rows_2020: the revision decides the coordinated arguments, and it parts from the 2020 grammar exactly on coordinations of selected phrases of different categories, in both papers' data.
• cp_subjects, exp1b_persisting: speaker variation as the absence or the persistence of S-features.
• mergesWith_iff_nominalCoordination: on prenominal modifiers the analysis agrees with the 2020 one, with no null head.
• adverb_mergesWith_maximal: an underspecified adverb merges with a maximal noun phrase and not with a nonmaximal one, the distinction the analysis needs.
• mergesWith_cmpr_iff: it extends to comparatives, where an adverb may also only be the conjunct away from the comparative.
• modifier_rows, stacked_rows, prenominal_rows_2020: it decides the examples and the 2020 paper's prenominal ones.
• exp1a_predictions, exp2_predictions, exp1b_predictions: the survey conditions the analysis admits, which are the ones rated higher (Tables 2, 4, 6).

Implementation notes

• S-features are present or absent. The superset requirement of §5.3 matters only for strengthen and withdraw (§5.6), which the paper excludes semantically (semantic_rows).
• The positive features of -ly adverbs are left open by the paper beyond excluding nouns; they are given verbs and adjectives here, and no theorem uses more than that they exclude nouns.
• Modifiers merge with a site, a position of a tree or a degree head, and whether the site is a maximal projection is read off its tree (PhraseStructure.IsMaximalCategory): the noun of (104) is projected further by its mother, while so soon adjoins to the maximal noun phrase a visit (p. 479). The features name maximal and nonmaximal projections (Selected); a modifier is a maximal phrase, since it is no head.
• Short displacement as a degree phrase ((105)) is not formalized.

References

• [Bru25]
• [BAK20]
• [PP23]
• [PS87b]

Categorial selection

theorem Bruening2025.selection_rows : ∃ e₁ ∈ Examples.all, ∃ e₂ ∈ Examples.all, e₁.feature? "construction" = some "selection" ∧ e₂.feature? "construction" = some "selection" ∧ e₁.feature? "complement" = e₂.feature? "complement" ∧ e₁.judgment ≠ e₂.judgment

Two complements of one category after become-type predicates differ in acceptability ((17)). Every complement here is semantically a predicate, so whether a predicate admits one is a further fact about it, c-selection (§4.1, after [PS87b]).

Coordinated arguments

theorem Bruening2025.cp_subjects : ¬BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies (BrueningAlKhalaf2020.checkedOnce HeadDirection.headFinal) {PhraseStructure.Cat.N}) [PhraseStructure.Cat.C] ∧ BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies (fun (x : List BrueningAlKhalaf2020.Conjunct) => []) {PhraseStructure.Cat.N}) [PhraseStructure.Cat.C]

A predicate with S-features rejects a clausal subject, which can only be a noun phrase under the null N, while one that imposes none admits it, so speakers who accept that images are waterproof is incoherent have a predicate without S-features (§5.7).

Adverbs

inductive Bruening2025.Degree : Type

The degree heads the analysis of adverbs refers to besides the categories of PhraseStructure.Cat (§5.8) are a comparative and an equative.

• cmpr : Degree

  A comparative, taller.

• eq : Degree

  An equative, as tall as.

@[instance_reducible]

instance Bruening2025.instDecidableEqDegree : DecidableEq Degree

Equations

• Bruening2025.instDecidableEqDegree x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

inductive Bruening2025.Selected : Type

The paper's c-selectional features name the maximal and the nonmaximal projections of a category, written NP and N (p. 479), and the degree heads.

• maximal (c : PhraseStructure.Cat) : Selected

  maximal c is a maximal projection of c, NP for a noun.

• nonmaximal (c : PhraseStructure.Cat) : Selected

  nonmaximal c is a nonmaximal projection of c, N for a noun.

• degree (d : Degree) : Selected

  degree d is a degree head.

@[instance_reducible]

instance Bruening2025.instDecidableEqSelected : DecidableEq Selected

Equations

• Bruening2025.instDecidableEqSelected = Bruening2025.instDecidableEqSelected.decEq

def Bruening2025.instDecidableEqSelected.decEq (x✝ x✝¹ : Selected) : Decidable (x✝ = x✝¹)

Equations

• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.maximal a) (Bruening2025.Selected.maximal b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.maximal c) (Bruening2025.Selected.nonmaximal c_1) = isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.maximal c) (Bruening2025.Selected.degree d) = isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.nonmaximal c) (Bruening2025.Selected.maximal c_1) = isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.nonmaximal a) (Bruening2025.Selected.nonmaximal b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.nonmaximal c) (Bruening2025.Selected.degree d) = isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.degree d) (Bruening2025.Selected.maximal c) = isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.degree d) (Bruening2025.Selected.nonmaximal c) = isFalse ⋯
• Bruening2025.instDecidableEqSelected.decEq (Bruening2025.Selected.degree a) (Bruening2025.Selected.degree b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯

inductive Bruening2025.Site : Type

What a coordination of modifiers merges with is a position in a tree or a degree head.

• at (t : PhraseStructure.Tree PhraseStructure.Cat String) (p : Core.Order.TreePath) : Site

  at t p is the position p of the tree t.

• degree (d : Degree) : Site

  degree d is a degree head.

@[instance_reducible]

instance Bruening2025.instDecidableEqSite : DecidableEq Site

Equations

• Bruening2025.instDecidableEqSite = Bruening2025.instDecidableEqSite.decEq

def Bruening2025.instDecidableEqSite.decEq (x✝ x✝¹ : Site) : Decidable (x✝ = x✝¹)

Equations

• Bruening2025.instDecidableEqSite.decEq (Bruening2025.Site.at a a_1) (Bruening2025.Site.at b b_1) = if h : a = b then h ▸ if h : a_1 = b_1 then h ▸ isTrue ⋯ else isFalse ⋯ else isFalse ⋯
• Bruening2025.instDecidableEqSite.decEq (Bruening2025.Site.at t p) (Bruening2025.Site.degree d) = isFalse ⋯
• Bruening2025.instDecidableEqSite.decEq (Bruening2025.Site.degree d) (Bruening2025.Site.at t p) = isFalse ⋯
• Bruening2025.instDecidableEqSite.decEq (Bruening2025.Site.degree a) (Bruening2025.Site.degree b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯

def Bruening2025.Selected.Matches : Selected → Site → Prop

A site is of a selected kind by its category and by whether its category is maximal, which is read off the tree.

Equations

• One or more equations did not get rendered due to their size.
• (Bruening2025.Selected.degree d).Matches (Bruening2025.Site.degree d') = (d = d')
• x✝¹.Matches x✝ = False

@[instance_reducible]

instance Bruening2025.instDecidableMatches (x : Selected) (h : Site) : Decidable (x.Matches h)

Equations

• One or more equations did not get rendered due to their size.
• Bruening2025.instDecidableMatches (Bruening2025.Selected.degree d) (Bruening2025.Site.degree d_1) = Bruening2025.instDecidableMatches._aux_3 d d_1
• Bruening2025.instDecidableMatches (Bruening2025.Selected.maximal c) (Bruening2025.Site.degree d) = isFalse ⋯
• Bruening2025.instDecidableMatches (Bruening2025.Selected.nonmaximal c) (Bruening2025.Site.degree d) = isFalse ⋯
• Bruening2025.instDecidableMatches (Bruening2025.Selected.degree d) (Bruening2025.Site.at t p) = isFalse ⋯

inductive Bruening2025.CFeature : Type

A modifier's c-selectional feature (§5.8) either requires what it merges with to be of one of some kinds or forbids it to be of any of them.

• sel (s : Finset Selected) : CFeature

  A positive feature, [C ∈ s].

• ban (s : Finset Selected) : CFeature

  A negative feature, [C ∉ s].

@[instance_reducible]

instance Bruening2025.instDecidableEqCFeature : DecidableEq CFeature

Equations

• Bruening2025.instDecidableEqCFeature = Bruening2025.instDecidableEqCFeature.decEq

def Bruening2025.instDecidableEqCFeature.decEq (x✝ x✝¹ : CFeature) : Decidable (x✝ = x✝¹)

Equations

• Bruening2025.instDecidableEqCFeature.decEq (Bruening2025.CFeature.sel a) (Bruening2025.CFeature.sel b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
• Bruening2025.instDecidableEqCFeature.decEq (Bruening2025.CFeature.sel s) (Bruening2025.CFeature.ban s_1) = isFalse ⋯
• Bruening2025.instDecidableEqCFeature.decEq (Bruening2025.CFeature.ban s) (Bruening2025.CFeature.sel s_1) = isFalse ⋯
• Bruening2025.instDecidableEqCFeature.decEq (Bruening2025.CFeature.ban a) (Bruening2025.CFeature.ban b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯

def Bruening2025.CFeature.ChecksNext : CFeature → Selected → Prop

A negative feature is checked off as soon as the next conjunct is merged, and fails if that conjunct is of a kind it bans. A positive feature waits.

Equations

• (Bruening2025.CFeature.sel s).ChecksNext x✝ = True
• (Bruening2025.CFeature.ban s).ChecksNext x✝ = (x✝ ∉ s)

def Bruening2025.CFeature.ChecksSite : CFeature → Site → Prop

The negative feature of the conjunct nearest the site is checked against it, and fails if the site is of a kind it bans.

Equations

• (Bruening2025.CFeature.sel s).ChecksSite x✝ = True
• (Bruening2025.CFeature.ban s).ChecksSite x✝ = ∀ x ∈ s, ¬x.Matches x✝

def Bruening2025.CFeature.ChecksHost : CFeature → Site → Prop

A positive feature on the coordinator's stack is checked against the site the coordination merges with, as is every feature on the stack ((75)).

Equations

• (Bruening2025.CFeature.sel s).ChecksHost x✝ = ∃ x ∈ s, x.Matches x✝
• (Bruening2025.CFeature.ban s).ChecksHost x✝ = True

@[instance_reducible]

instance Bruening2025.CFeature.instDecidablePredSelectedChecksNext (f : CFeature) : DecidablePred f.ChecksNext

Equations

• One or more equations did not get rendered due to their size.

@[instance_reducible]

instance Bruening2025.CFeature.instDecidablePredSiteChecksSite (f : CFeature) : DecidablePred f.ChecksSite

Equations

• One or more equations did not get rendered due to their size.

@[instance_reducible]

instance Bruening2025.CFeature.instDecidablePredSiteChecksHost (f : CFeature) : DecidablePred f.ChecksHost

Equations

• One or more equations did not get rendered due to their size.

structure Bruening2025.Modifier : Type

A modifier is a phrase of some category with a c-selectional feature.

• cat : Selected

  cat is the modifier's category, a maximal one, since a modifier is no head.

• feature : CFeature

  The modifier's c-selectional feature.

@[instance_reducible]

instance Bruening2025.instDecidableEqModifier : DecidableEq Modifier

Equations

• Bruening2025.instDecidableEqModifier = Bruening2025.instDecidableEqModifier.decEq

def Bruening2025.instDecidableEqModifier.decEq (x✝ x✝¹ : Modifier) : Decidable (x✝ = x✝¹)

Equations

• Bruening2025.instDecidableEqModifier.decEq { cat := a, feature := a_1 } { cat := b, feature := b_1 } = if h : a = b then h ▸ if h : a_1 = b_1 then h ▸ isTrue ⋯ else isFalse ⋯ else isFalse ⋯

def Bruening2025.Modifier.adjective : Modifier

An adjective selects a nonmaximal noun (§4.1).

Equations

• Bruening2025.Modifier.adjective = { cat := Bruening2025.Selected.maximal PhraseStructure.Cat.Adj, feature := Bruening2025.CFeature.sel {Bruening2025.Selected.nonmaximal PhraseStructure.Cat.N} }

def Bruening2025.Modifier.adverb : Modifier

An underspecified adverb such as once, twice or soon may merge with anything but a nonmaximal noun or a comparative (§5.8).

Equations

• One or more equations did not get rendered due to their size.

def Bruening2025.Modifier.lyAdverb : Modifier

An adverb in -ly selects what adverbs modify, verbs and adjectives, and not nouns (§4.1).

Equations

• One or more equations did not get rendered due to their size.

def Bruening2025.Modifier.measure : Modifier

A measure phrase such as three times selects a comparative (p. 479).

Equations

• Bruening2025.Modifier.measure = { cat := Bruening2025.Selected.maximal PhraseStructure.Cat.N, feature := Bruening2025.CFeature.sel {Bruening2025.Selected.degree Bruening2025.Degree.cmpr} }

def Bruening2025.Modifier.ofAdvHead : Option BrueningAlKhalaf2020.AdvHead → Modifier

The modifier the 2020 analysis's adjective, silent-headed adverb or adverb in -ly is here.

Equations

• Bruening2025.Modifier.ofAdvHead none = Bruening2025.Modifier.adjective
• Bruening2025.Modifier.ofAdvHead (some BrueningAlKhalaf2020.AdvHead.silent) = Bruening2025.Modifier.adverb
• Bruening2025.Modifier.ofAdvHead (some BrueningAlKhalaf2020.AdvHead.ly) = Bruening2025.Modifier.lyAdverb

def Bruening2025.MergesWith (ms : List Modifier) (h : Site) : Prop

A coordination of modifiers ms can merge with the site h when the negative feature of each conjunct is checked off by the next conjunct and that of the last by h, the last conjunct's features being on top of the coordinator's stack, and every positive feature on the stack is satisfied by h ((100)–(104)).

Equations

• One or more equations did not get rendered due to their size.

@[instance_reducible]

instance Bruening2025.instDecidableMergesWith (ms : List Modifier) (h : Site) : Decidable (MergesWith ms h)

Equations

• Bruening2025.instDecidableMergesWith ms h = id inferInstance

def Bruening2025.onceAndFutureKing : PhraseStructure.Tree PhraseStructure.Cat String

In (104) the coordination once and future merges with king, which its mother projects further, so the host is a nonmaximal noun.

Equations

• One or more equations did not get rendered due to their size.

def Bruening2025.soSoonAVisit : PhraseStructure.Tree PhraseStructure.Cat String

In so soon a visit, so soon adjoins to the maximal noun phrase a visit (p. 479).

Equations

• One or more equations did not get rendered due to their size.

@[reducible, inline]

abbrev Bruening2025.nounSite : Site

The site prenominal modifiers merge with is the nonmaximal noun of (104).

Equations

• Bruening2025.nounSite = Bruening2025.Site.at Bruening2025.onceAndFutureKing { toList := [1] }

theorem Bruening2025.adverb_mergesWith_iff {h : Site} : MergesWith [Modifier.adverb] h ↔ ¬(Selected.nonmaximal PhraseStructure.Cat.N).Matches h ∧ ¬(Selected.degree Degree.cmpr).Matches h

An underspecified adverb alone merges with anything but a nonmaximal noun or a comparative, so twice is out before taller and in before as tall as ((97)).

theorem Bruening2025.adverb_mergesWith_maximal : MergesWith [Modifier.adverb] (Site.at soSoonAVisit { toList := [1] }) ∧ ¬MergesWith [Modifier.adverb] nounSite

An underspecified adverb merges with the maximal noun phrase so soon adjoins to, and not with the nonmaximal noun of (104), the distinction the analysis needs (p. 479); which one a site is follows from adjunction against projection in its tree.

theorem Bruening2025.mergesWith_iff_nominalCoordination (m₁ m₂ : Option BrueningAlKhalaf2020.AdvHead) : MergesWith [Modifier.ofAdvHead m₁, Modifier.ofAdvHead m₂] nounSite ↔ BrueningAlKhalaf2020.NominalCoordination m₁ m₂

On prenominal modifiers the analysis agrees with the 2020 one (p. 480). Coordinated before a noun, an adjective or an underspecified adverb may come first and only an adjective last, as the 2020 analysis derives from a silent Adv head and the ban on adverbs modifying N′, while this one needs neither.

theorem Bruening2025.mergesWith_cmpr_iff (x : Modifier) : x ∈ [Modifier.measure, Modifier.adverb] → ∀ y ∈ [Modifier.measure, Modifier.adverb], MergesWith [x, y] (Site.degree Degree.cmpr) ↔ y = Modifier.measure

It extends to comparatives, which the 2020 analysis does not cover. Coordinated with a measure phrase before a comparative, an underspecified adverb must come first, as in twice and maybe even three times taller but not one point five times or even twice taller ((98)).

The paper's examples

def Bruening2025.modifierOf? (s : String) : Option Modifier

modifierOf? s is the modifier the label s names.

Equations

• One or more equations did not get rendered due to their size.

def Bruening2025.modifierList? (e : Datum) : Option (List Modifier)

modifierList? e lists a row's modifiers, in order.

Equations

• Bruening2025.modifierList? e = List.mapM Bruening2025.modifierOf? (e.features "modifier")

def Bruening2025.host? (e : Datum) : Option Site

host? e is the site a row's modifiers merge with, the noun of (104) for a noun.

Equations

• One or more equations did not get rendered due to their size.

theorem Bruening2025.construction_rows (e : Datum) : e ∈ Examples.all → e.feature? "construction" ∈ [some "argument", some "semantic", some "selection", some "modifiers", some "stacked"]

Every row is one of the five constructions below.

theorem Bruening2025.argument_rows (e : Datum) : e ∈ Examples.all → e.feature? "construction" = some "argument" → ∃ ps ∈ BrueningAlKhalaf2020.phrases? e, ∃ cats ∈ BrueningAlKhalaf2020.selects? e, ∃ d ∈ BrueningAlKhalaf2020.side? e, BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies (BrueningAlKhalaf2020.checkedOnce d) cats) ps ↔ e.judgment = Judgment.acceptable

The revision decides the arguments, alone or coordinated ((9)–(10), (14), (38)–(39), (42b), (52a)).

theorem Bruening2025.argument_rows_licensed (e : Datum) : e ∈ Examples.all → e.feature? "construction" = some "argument" → e.judgment = Judgment.acceptable → ∃ ps ∈ BrueningAlKhalaf2020.phrases? e, ∃ cats ∈ BrueningAlKhalaf2020.selects? e, ∃ d ∈ BrueningAlKhalaf2020.side? e, ¬BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Licensed (BrueningAlKhalaf2020.checkedOnce d) cats) ps ↔ (∀ p ∈ ps, p ∈ cats) ∧ ∃ p ∈ ps, ∃ q ∈ ps, p ≠ q

Of the acceptable coordinated arguments, the 2020 grammar rejects exactly those whose conjuncts are all selected and differ in category ((9), (10), (14a)).

theorem Bruening2025.argument_rows_2020 (e : Datum) : e ∈ BrueningAlKhalaf2020.Examples.all → e.feature? "construction" = some "argument" → ∃ ps ∈ BrueningAlKhalaf2020.phrases? e, ∃ cats ∈ BrueningAlKhalaf2020.selects? e, ∃ d ∈ BrueningAlKhalaf2020.side? e, BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies (BrueningAlKhalaf2020.checkedOnce d) cats) ps ↔ e.judgment = Judgment.acceptable ∨ (∀ p ∈ ps, p ∈ cats) ∧ ∃ p ∈ ps, ∃ q ∈ ps, p ≠ q

On the 2020 paper's arguments the revision keeps every judgment except on the coordinations of selected phrases of different categories, its (64) and (69), which it admits.

theorem Bruening2025.semantic_rows (e : Datum) : e ∈ Examples.all → e.feature? "construction" = some "semantic" → e.judgment ≠ Judgment.acceptable ∧ ∃ ps ∈ BrueningAlKhalaf2020.phrases? e, ∃ cats ∈ BrueningAlKhalaf2020.selects? e, ∃ d ∈ BrueningAlKhalaf2020.side? e, BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies (BrueningAlKhalaf2020.checkedOnce d) cats) ps

The revision admits strengthen and withdraw with a noun phrase coordinated with a clause, which the paper excludes semantically ((42c), §5.6).

theorem Bruening2025.modifier_rows (e : Datum) : e ∈ Examples.all → e.feature? "construction" = some "modifiers" → ∃ ms ∈ modifierList? e, ∃ h ∈ host? e, MergesWith ms h ↔ e.judgment = Judgment.acceptable

The analysis decides the coordinated and lone modifiers ((22), (36), (97)–(99)).

theorem Bruening2025.stacked_rows (e : Datum) : e ∈ Examples.all → e.feature? "construction" = some "stacked" → ∃ ms ∈ modifierList? e, ∃ h ∈ host? e, (∀ m ∈ ms, MergesWith [m] h) ↔ e.judgment = Judgment.acceptable

Stacked modifiers each merge with a projection of the noun, so an underspecified adverb cannot precede an adjective uncoordinated ((20), (66), (67)).

theorem Bruening2025.prenominal_rows_2020 (e : Datum) : e ∈ BrueningAlKhalaf2020.Examples.all → e.feature? "construction" = some "prenominal" → ∃ ms ∈ modifierList? e, MergesWith ms nounSite ↔ e.judgment = Judgment.acceptable

The analysis decides the 2020 paper's prenominal examples ((44), its p. 15, (56a), (57a)).

The surveys

def Bruening2025.Exp1aCondition.modifiers : Exp1aCondition → Option (List Modifier)

c.modifiers is the lone prenominal modifier of the items of a condition of Experiment 1a.

Equations

• Bruening2025.Exp1aCondition.adjective.modifiers = some [Bruening2025.Modifier.adjective]
• Bruening2025.Exp1aCondition.adverb.modifiers = some [Bruening2025.Modifier.adverb]
• x✝.modifiers = none

theorem Bruening2025.exp1a_predictions (c : Exp1aCondition) (ms : List Modifier) : ms ∈ c.modifiers → (MergesWith ms nounSite ↔ c = Exp1aCondition.adjective)

The analysis admits the adjectives of Experiment 1a and not the adverbs.

def Bruening2025.Exp2Condition.modifiers : Exp2Condition → Option (List Modifier)

c.modifiers is the lone prenominal modifier of the items of a condition of Experiment 2, whose one-replacement rules out a compound.

Equations

• Bruening2025.Exp2Condition.adjective.modifiers = some [Bruening2025.Modifier.adjective]
• Bruening2025.Exp2Condition.adverb.modifiers = some [Bruening2025.Modifier.adverb]
• x✝.modifiers = none

theorem Bruening2025.exp2_predictions (c : Exp2Condition) (ms : List Modifier) : ms ∈ c.modifiers → (MergesWith ms nounSite ↔ c = Exp2Condition.adjective)

The analysis admits the adjectives of Experiment 2 and not the adverbs.

def Bruening2025.Exp1bCondition.phrases : Exp1bCondition → Option (List PhraseStructure.Cat)

c.phrases is the complement of the items of a condition of Experiment 1b, all after a preposition or verb that selects noun phrases only.

Equations

• Bruening2025.Exp1bCondition.coordination.phrases = some [PhraseStructure.Cat.N, PhraseStructure.Cat.C]
• Bruening2025.Exp1bCondition.simple.phrases = some [PhraseStructure.Cat.C]
• x✝.phrases = none

theorem Bruening2025.exp1b_predictions (c : Exp1bCondition) (ps : List PhraseStructure.Cat) : ps ∈ c.phrases → (BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies (BrueningAlKhalaf2020.checkedOnce HeadDirection.headInitial) {PhraseStructure.Cat.N}) ps ↔ c = Exp1bCondition.coordination)

The revision admits the coordinations of Experiment 1b and not the bare clauses.

theorem Bruening2025.exp1b_persisting (c : Exp1bCondition) (ps : List PhraseStructure.Cat) : ps ∈ c.phrases → ¬BrueningAlKhalaf2020.Admits (BrueningAlKhalaf2020.Satisfies id {PhraseStructure.Cat.N}) ps

For the speakers whose S-features persist, about a tenth of those surveyed (p. 457), the coordinations of Experiment 1b are out as well (§5.9, after mem_cats_of_admits_id).