@cite{rouillard-2026}: Temporal in-Adverbials — Empirical Data

@cite{kennedy-2007} @cite{rouillard-2026} @cite{vendler-1957} @cite{ladusaw-1979}

Empirical distributional data and verification theorems for temporal in-adverbials (TIAs), following @cite{rouillard-2026} "Maximal informativity accounts for the distribution of temporal in-adverbials" (L&P 49:1–56).

Data Points

E-TIAs (Event TIAs): measure event durations

• (1a) "Mary wrote up a paper in three days." ✓ — telic VP (accomplishment)
• (1b) "*Mary was sick in three days." ✗ — atelic VP (state)
• (88) "The climber reached the summit in three days." ✓ — telic (achievement)

G-TIAs (Gap TIAs): measure gap durations, NPIs

• (2a) "Mary hasn't been sick in three days." ✓ — negative perfect
• (2b) "*Mary has been sick in three days." ✗ — positive perfect
• (48) "*Mary wasn't sick in three days." ✗ — simple past, no perfect

E‑ and U‑Perfect Ambiguity

• (53) "Mary hasn't written up a paper in three days." — ambiguous E-TIA / G-TIA
• (54) "Mary has been sick for three days." — ambiguous E-perfect / U-perfect

Architectural Role

This file is a Phenomena file: it imports Theories and verifies that theoretical predictions match empirical observations. It does NOT define new theoretical machinery.

structure Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.ETIADatum : Type

E-TIA acceptability datum: VP class → acceptable with E-TIA?

• vp : String

  Description of the VP

• vendlerClass : Semantics.Tense.Aspect.LexicalAspect.VendlerClass

  Vendler class of the VP

• acceptable : Bool

  Whether "VP in three days" is acceptable

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprETIADatum : Repr ETIADatum

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprETIADatum = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprETIADatum.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprETIADatum.repr : ETIADatum → ℕ → Std.Format

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_1a : ETIADatum

(1a) "Mary wrote up a paper in three days." — accomplishment, ✓

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_1b : ETIADatum

(1b) "*Mary was sick in three days." — state, ✗

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_1b = { vp := "be sick", vendlerClass := Semantics.Tense.Aspect.LexicalAspect.VendlerClass.state, acceptable := false }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_88 : ETIADatum

(88) "The climber reached the summit in three days." — achievement, ✓

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_88 = { vp := "reach the summit", vendlerClass := Semantics.Tense.Aspect.LexicalAspect.VendlerClass.achievement, acceptable := true }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_84 : ETIADatum

(84) "*The dancers waltzed in one hour." — activity, ✗

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_84 = { vp := "waltz", vendlerClass := Semantics.Tense.Aspect.LexicalAspect.VendlerClass.activity, acceptable := false }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIAData : List ETIADatum

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_predicted_by_telicity (d : ETIADatum) : Bool

E-TIA acceptability is predicted by telicity: telic VPs accept E-TIAs, atelic VPs reject them.

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_predicted_by_telicity d = ((d.vendlerClass.telicity == Semantics.Tense.Aspect.LexicalAspect.Telicity.telic) == d.acceptable)

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_all_predicted : eTIAData.all eTIA_predicted_by_telicity = true

All E-TIA data points are predicted by telicity.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_1a_telic : datum_1a.vendlerClass.telicity = Semantics.Tense.Aspect.LexicalAspect.Telicity.telic

(1a) Accomplishment → telic → E-TIA acceptable.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_1b_atelic : datum_1b.vendlerClass.telicity = Semantics.Tense.Aspect.LexicalAspect.Telicity.atelic

(1b) State → atelic → E-TIA unacceptable.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_88_telic : datum_88.vendlerClass.telicity = Semantics.Tense.Aspect.LexicalAspect.Telicity.telic

(88) Achievement → telic → E-TIA acceptable.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_84_atelic : datum_84.vendlerClass.telicity = Semantics.Tense.Aspect.LexicalAspect.Telicity.atelic

(84) Activity → atelic → E-TIA unacceptable.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.accomplishment_licensed : (Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness Semantics.Tense.Aspect.LexicalAspect.VendlerClass.accomplishment).isLicensed = true

E-TIA licensing follows from the Kennedy–Rouillard isomorphism: telic VPs map to closed/bounded scales, predicting licensing.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.achievement_licensed : (Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness Semantics.Tense.Aspect.LexicalAspect.VendlerClass.achievement).isLicensed = true

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.state_blocked : (Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness Semantics.Tense.Aspect.LexicalAspect.VendlerClass.state).isLicensed = false

Atelic VPs map to open/unbounded scales, predicting blocking.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.activity_blocked : (Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness Semantics.Tense.Aspect.LexicalAspect.VendlerClass.activity).isLicensed = false

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_predicted_by_boundedness (d : ETIADatum) : Bool

The prediction matches the data for every datum.

Equations

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

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_boundedness_all_predicted : eTIAData.all eTIA_predicted_by_boundedness = true

structure Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.GTIADatum : Type

G-TIA datum: polarity × perfect → acceptable?

• sentence : String

  Description of the sentence

• isNegative : Bool

  Is the sentence negative?

• hasPerfect : Bool

  Does the sentence contain a perfect?

• acceptable : Bool

  Whether the G-TIA is acceptable

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprGTIADatum.repr : GTIADatum → ℕ → Std.Format

Equations

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

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprGTIADatum : Repr GTIADatum

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprGTIADatum = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprGTIADatum.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_2a : GTIADatum

(2a) "Mary hasn't been sick in three days." — negative perfect, ✓

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_2a = { sentence := "Mary hasn't been sick in three days", isNegative := true, hasPerfect := true, acceptable := true }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_2b : GTIADatum

(2b) "*Mary has been sick in three days." — positive perfect, ✗

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_2b = { sentence := "Mary has been sick in three days", isNegative := false, hasPerfect := true, acceptable := false }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_48 : GTIADatum

(48) "*Mary wasn't sick in three days." — negative, no perfect, ✗

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.datum_48 = { sentence := "Mary wasn't sick in three days", isNegative := true, hasPerfect := false, acceptable := false }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.gTIAData : List GTIADatum

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.gTIA_predicted (d : GTIADatum) : Bool

G-TIA acceptability predicted by: requires BOTH negative polarity AND perfect. @cite{rouillard-2026} Table 1: only NEG + G-TIA + PFV reading is acceptable.

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.gTIA_predicted d = ((d.isNegative && d.hasPerfect) == d.acceptable)

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.gTIA_all_predicted : gTIAData.all gTIA_predicted = true

All G-TIA data points match the polarity + perfect prediction.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.gTIA_licensing_from_fragment : Fragments.English.TemporalAdverbials.inGTIA.requiresNegative = true ∧ Fragments.English.TemporalAdverbials.inGTIA.requiresPerfect = true

G-TIA licensing is derived from Fragment entry fields, not stipulated. The prediction isNegative && hasPerfect matches the Fragment's requiresNegative && requiresPerfect on inGTIA.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_licensing_from_fragment : Fragments.English.TemporalAdverbials.inETIA.requiresTelic = true ∧ Fragments.English.TemporalAdverbials.inETIA.requiresNegative = false

E-TIA licensing is derived from Fragment: requires telicity, not polarity.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.npi_status_from_fragment : Fragments.English.TemporalAdverbials.inGTIA.isNPI = true ∧ Fragments.English.TemporalAdverbials.inETIA.isNPI = false

G-TIA NPI status from Fragment: G-TIA is an NPI, E-TIA is not.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stacking_positions_from_fragment : Fragments.English.TemporalAdverbials.inETIA.position = Fragments.English.TemporalAdverbials.AdverbialPosition.eventLevel ∧ Fragments.English.TemporalAdverbials.inGTIA.position = Fragments.English.TemporalAdverbials.AdverbialPosition.perfectLevel

Stacking constraint from Fragment: E-TIA is event-level (inner), G-TIA is perfect-level (outer). The syntactic positions determine the only acceptable stacking order.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.shared_preposition_from_fragment : Fragments.English.TemporalAdverbials.inETIA.preposition = Fragments.English.TemporalAdverbials.inGTIA.preposition

E-TIA and G-TIA share the preposition in (Fragment verification).

structure Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.Table1Entry : Type

@cite{rouillard-2026} Table 1: readings for "*Mary has been sick in three days" and its negation, crossed with aspect and TIA type.

• polarity : Bool
• tiaType : Bool
• aspect : Bool
• mipBlocks : Bool

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprTable1Entry : Repr Table1Entry

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprTable1Entry = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprTable1Entry.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprTable1Entry.repr : Table1Entry → ℕ → Std.Format

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instDecidableEqTable1Entry.decEq (x✝ x✝¹ : Table1Entry) : Decidable (x✝ = x✝¹)

Equations

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

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instDecidableEqTable1Entry : DecidableEq Table1Entry

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instDecidableEqTable1Entry = Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instDecidableEqTable1Entry.decEq

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqTable1Entry.beq : Table1Entry → Table1Entry → Bool

Equations

• One or more equations did not get rendered due to their size.
• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqTable1Entry.beq x✝¹ x✝ = false

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqTable1Entry : BEq Table1Entry

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqTable1Entry = { beq := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqTable1Entry.beq }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.table1 : List Table1Entry

All 8 cells of Table 1 (sentence (112)) "*Mary has been sick in 3 days").

Equations

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

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.exactly_one_survives : (List.filter (fun (e : Table1Entry) => !e.mipBlocks) table1).length = 1

Exactly one reading survives: NEG + G-TIA + PFV (E-perfect).

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.surviving_is_neg_gtia_pfv : List.filter (fun (e : Table1Entry) => !e.mipBlocks) table1 = [{ polarity := false, tiaType := false, aspect := true, mipBlocks := false }]

The surviving reading is the negative G-TIA with perfective aspect.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.homogeneous_implies_open_scale (p : Semantics.Tense.Aspect.LexicalAspect.AspectualProfile) (h : p.isHomogeneous = true) : Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness p.toVendlerClass = Core.Scale.Boundedness.open_

The subinterval property (homogeneity) corresponds to open-scale boundedness in the Kennedy–Rouillard isomorphism. homogeneous_iff_atelic (from Aspect.lean) + atelic_open (from MaximalInformativity.lean) form the bridge chain: homogeneous → atelic → open scale → E-TIA blocked.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.nonhomogeneous_implies_closed_scale (p : Semantics.Tense.Aspect.LexicalAspect.AspectualProfile) (h : p.isHomogeneous = false) : Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness p.toVendlerClass = Core.Scale.Boundedness.closed

Non-homogeneous (telic) → closed scale → E-TIA licensed.

@cite{rouillard-2026} §6.1 — argues that G-TIAs are NPIs licensed by maximal informativity, NOT by downward entailment. The key evidence:

1. DE-based accounts (@cite{hoeksema-2006}, @cite{gajewski-2005}/2007) incorrectly predict
   E-TIAs should also be polarity-sensitive (they aren't — E-TIAs are aspect-
   sensitive, not polarity-sensitive).
2. The MIP accounts for BOTH E-TIA (aspect) and G-TIA (polarity) restrictions
   from a single principle.
3. G-TIAs pattern with strong NPIs (anti-additive, not merely DE), but their
   licensing condition is orthogonal to the DE hierarchy. 

inductive Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.LicensingMechanism : Type

NPI licensing mechanism: DE vs MIP. Rouillard argues MIP subsumes DE for G-TIAs.

• downwardEntailment : LicensingMechanism
• maximalInformativity : LicensingMechanism

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instDecidableEqLicensingMechanism : DecidableEq LicensingMechanism

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instDecidableEqLicensingMechanism x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprLicensingMechanism : Repr LicensingMechanism

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprLicensingMechanism = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprLicensingMechanism.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprLicensingMechanism.repr : LicensingMechanism → ℕ → Std.Format

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqLicensingMechanism.beq : LicensingMechanism → LicensingMechanism → Bool

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqLicensingMechanism.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqLicensingMechanism : BEq LicensingMechanism

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqLicensingMechanism = { beq := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instBEqLicensingMechanism.beq }

structure Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.NPIPrediction : Type

NPI prediction: does a licensing mechanism correctly predict both E-TIA and G-TIA distributions?

• mechanism : LicensingMechanism
• predictsETIA : Bool

  Correctly predicts E-TIA distribution (aspect-sensitive, not polarity)?

• predictsGTIA : Bool

  Correctly predicts G-TIA polarity sensitivity?

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprNPIPrediction.repr : NPIPrediction → ℕ → Std.Format

Equations

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

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprNPIPrediction : Repr NPIPrediction

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprNPIPrediction = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprNPIPrediction.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.dePrediction : NPIPrediction

DE incorrectly restricts E-TIAs by polarity (Rouillard §6.1, p. 49–50): a condition like (144) would block E-TIAs in ALL non-DE environments, but E-TIAs are fine in positive telic sentences.

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.mipPrediction : NPIPrediction

MIP correctly handles both E-TIAs (via telicity/informativity) and G-TIAs (via open PTS/information collapse).

Equations

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

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.mip_subsumes_de : (mipPrediction.predictsETIA && decide (mipPrediction.predictsGTIA = true)) = true ∧ dePrediction.predictsETIA = false

MIP is strictly more explanatory: it handles both distributions. DE handles only G-TIAs and makes wrong predictions for E-TIAs.

structure Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.SinceWhenDatum : Type

Since-when question datum: which perfect readings are available?

• sentence : String
• uPerfect : Bool

  U-perfect reading available?

• ePerfect : Bool

  E-perfect reading available?

• reason : String

  Reason E-perfect is blocked (if blocked)

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprSinceWhenDatum : Repr SinceWhenDatum

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprSinceWhenDatum = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprSinceWhenDatum.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprSinceWhenDatum.repr : SinceWhenDatum → ℕ → Std.Format

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.sinceWhen_131 : SinceWhenDatum

(131) "Since when has Mary been sick?" -- U-perfect only. @cite{von-fintel-iatridou-2019}: since-when Qs lack E- vs U-perfect ambiguity.

Equations

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

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.sinceWhen_blocks_ePerfect : sinceWhen_131.ePerfect = false ∧ sinceWhen_131.uPerfect = true

Since-when questions always lack the E-perfect reading. This is predicted by the MIP applied to Hamblin answerhood (eq. 135): ANS requires a maximally informative true answer in the Hamblin set, but the E-perfect Hamblin set can never have one (by density).

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.since_fragment_bridge : Fragments.English.TemporalAdverbials.since.requiresPerfect = true ∧ Fragments.English.TemporalAdverbials.since.specifiesLB = true

Fragment bridge: since requires the perfect and specifies the LB of PTS, matching the since-when question's presupposition structure.

@cite{rouillard-2026} §3.2, ex. (60) — when two TIAs are stacked, the inner (VP-adjacent) one must be an E-TIA and the outer one a G-TIA. The reverse order is ungrammatical.

(60a) "Mary hasn't written up a paper in three days in two weeks." ✓
       inner = "in three days" (E-TIA, modifies VP)
       outer = "in two weeks" (G-TIA, modifies AspP)

(60b) "#Mary hasn't written up a paper in two weeks in three days." ✗
       inner = "in two weeks" (G-TIA?), outer = "in three days" (E-TIA?)
       — violates the syntactic position constraint 

structure Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.StackingDatum : Type

TIA stacking datum: inner and outer adverbial types.

• sentence : String
• innerIsETIA : Bool

  Is the inner (VP-adjacent) TIA an E-TIA?

• outerIsGTIA : Bool

  Is the outer TIA a G-TIA?

• acceptable : Bool

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprStackingDatum.repr : StackingDatum → ℕ → Std.Format

Equations

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

instance Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprStackingDatum : Repr StackingDatum

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprStackingDatum = { reprPrec := Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.instReprStackingDatum.repr }

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stacking_60a : StackingDatum

(60a) Inner E-TIA + outer G-TIA: acceptable.

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stacking_60b : StackingDatum

(60b) Reversed order: unacceptable.

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stackingData : List StackingDatum

Equations

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

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stacking_predicted (d : StackingDatum) : Bool

Stacking acceptability = inner is E-TIA ∧ outer is G-TIA. Derives from syntactic positions: E-TIAs are event-level (VP-adjacent), G-TIAs are perfect-level (AspP-adjacent). Proximity to VP determines reading (Rouillard §3.2, schemata (57), (61)).

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stacking_predicted d = ((d.innerIsETIA && d.outerIsGTIA) == d.acceptable)

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.stacking_all_predicted : stackingData.all stacking_predicted = true

Connecting E-TIA data to the universal LicensingPipeline

The E-TIA data (§1–3) is verified against scaleBoundedness (§3) and telicity (§2). Here we extend the bridge to LicensingPipeline, the universal interface that connects adjective licensing, path licensing, mereological licensing, and temporal licensing through a single mechanism.

def Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_predicted_by_pipeline (d : ETIADatum) : Bool

Every E-TIA datum is predicted by LicensingPipeline.isLicensed.

Equations

• Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_predicted_by_pipeline d = (Core.Scale.LicensingPipeline.isLicensed d.vendlerClass == d.acceptable)

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.eTIA_pipeline_all_predicted : eTIAData.all eTIA_predicted_by_pipeline = true

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.pipeline_agrees_with_boundedness (c : Semantics.Tense.Aspect.LexicalAspect.VendlerClass) : Core.Scale.LicensingPipeline.isLicensed c = (Semantics.Montague.Sentence.MaximalInformativity.scaleBoundedness c).isLicensed

Pipeline agrees with direct scaleBoundedness on all four Vendler classes. With compositional chains, the pipeline instance and scaleBoundedness both route through VendlerClass →.telicity Telicity →.toMereoTag MereoTag →.toBoundedness Boundedness, so agreement is definitional.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.atelic_collapses_like_open_adj : Core.Scale.LicensingPipeline.isLicensed Core.Time.SituationBoundedness.unbounded = Core.Scale.LicensingPipeline.isLicensed Core.Scale.Boundedness.open_

Atelic (state/activity) collapses like open adjective (tall): SituationBoundedness.unbounded ↔ Boundedness.open_.

theorem Phenomena.TenseAspect.TemporalAdverbials.Rouillard2026.bounded_licenses_like_closed_adj : Core.Scale.LicensingPipeline.isLicensed Core.Time.SituationBoundedness.bounded = Core.Scale.LicensingPipeline.isLicensed Core.Scale.Boundedness.closed

Bounded situations license like closed adjectives (full): SituationBoundedness.bounded ↔ Boundedness.closed.