Rouillard 2026: Temporal in-Adverbials and the Maximal Informativity Principle #
@cite{rouillard-2026} @cite{fox-hackl-2006} @cite{fox-2007} @cite{beck-rullmann-1999} @cite{krifka-1989} @cite{krifka-1998} @cite{vendler-1957} @cite{ladusaw-1979} @cite{iatridou-zeijlstra-2021} @cite{hoeksema-2006} @cite{gajewski-2011} @cite{von-fintel-iatridou-2019}
@cite{rouillard-2026} "Maximal informativity accounts for the distribution of temporal in-adverbials" (Linguistics and Philosophy 49:1–56).
Core contribution #
Temporal in-adverbials (TIAs) lead a double life:
- E-TIAs ("wrote a paper in three days") measure event durations. Acceptable only with telic VPs.
- G-TIAs ("hasn't been sick in three days") measure gap durations. NPI behavior: acceptable only in negative perfects.
Both distributional restrictions follow from a single principle: the Maximal Informativity Principle (MIP). For some constituent γ containing the TIA, the numeral must be capable of being the maximally informative value of γ's derived property. Where no maximally informative numeral exists ("information collapse"), the TIA is blocked.
Architecture of the formalization #
This file consolidates Rouillard's formal apparatus and the empirical
verification into a single Studies file. The companion
MaximalInformativity.lean was deleted in this rebuild — its content was
absorbed here, with substrate primitives lifted to Core.Scale and
Core.Time.Interval.Generalized.
Sections:
- Re-export of substrate (
Core.Scaleinformativity primitives). TimeMeasuretypeclass (replaces the priorMeasureFunstruct).- Prior time spans over
GInterval(open/closed boundary tags structurally carried, eliminating the priorPERF_openhand-waving). - E-TIA semantics:
eTIAProperty. - G-TIA semantics over open generalized intervals:
gTIAPropertyOpen. - The MIP licensing predicate (imported from
Entailment.Extremum), combiningAdmitsOptimum(atelic-collapse failure mode) with per-worldIsLeast/IsGreatestfrom mathlib (no-extremum failure mode). - E-TIA:
HasSubintervalProp → IsConstant → ¬ AdmitsOptimum(atelic block). - E-TIA: telicity → upward monotone →
IsLeast {y | P y w}exists at event-duration. - G-TIA: geometric no-smallest-open-PTS (the density witness Rouillard
uses). The full MIP-collapse claim under just
[DenselyOrdered Time]with ℕ-valued measure does NOT follow without additional threshold-richness assumptions on the world space; we prove the geometric witness and note the gap. (See § 9 docstring for details.) - G-TIA negative: downward monotone →
IsGreatest {y | P y w}exists at gap-length. - Boundedness pipeline (Vendler→Telicity→MereoTag→Boundedness, used by
LicensingPipelinefor the empirical predictions in § 13). - Paper-specific apparatus (TIAType, AdverbialPosition, projection from consensus Fragment fields).
- E-TIA empirical data (Prop fields, decided via the boundedness chain).
- G-TIA empirical data (Prop fields, decided via polarity ∧ perfect).
- Table 1 (8 cells of paper eq. (112), survivor derived not stipulated).
- Stacking constraint (paper §3.2, ex. 60).
- Since-when questions (paper §5.2).
- Fragment bridges (consensus → Rouillard projection).
Scope notes #
- Cross-framework refutation theorems (Ladusaw 1979 DE-overprediction, Krifka 1989 ATM-vs-QUA divergence, Champollion stratified reference divergence, Pancheva/Kiparsky perfect bridge) are out of scope for this file by user direction; they belong in dedicated cross-framework Studies.
- The
LicensingMechanismenum +mip_subsumes_destrawman of the prior file is dropped — a real DE comparison would need to engagePhenomena/Polarity/Studies/Ladusaw1979.leanrather than stipulate. - The "Kennedy–Rouillard isomorphism" framing of the prior file's § 7 is dropped — Rouillard does not invoke Kennedy adjectival scales. The boundedness chain is retained as substrate-internal plumbing.
A temporal measure: assigns natural-number durations to intervals,
extensible upward and subdivisible downward. Replaces the prior
MeasureFun struct (a thin-bundled struct anti-pattern); the μ
function is now a bare typeclass parameter so projections like
μ i ≤ m need no μ.μ double-dotting.
@cite{rouillard-2026} §2.2.2: temporal measure units (days, hours) are additive, hence any interval can be padded or trimmed to any target measure within a one-sided bound.
Mathlib correspondence: Core.Mereology.ExtMeasure is ℚ-valued and
requires [SemilatticeSup α] on the carrier. Intervals are not
join-semilattices (disjoint intervals cannot be joined into an
interval), so ExtMeasure does not apply directly. TimeMeasure
is the interval-specific ℕ-valued companion; the discrete-measure
domain matches Rouillard's integer-numeral data ("in three days").
- extensible (i : Core.Time.Interval Time) (m : ℕ) : μ i ≤ m → ∃ (j : Core.Time.Interval Time), i.subinterval j ∧ μ j = m
Any interval can be extended to a superinterval with a given larger measure.
- subdivisible (i : Core.Time.Interval Time) (m : ℕ) : m ≤ μ i → ∃ (j : Core.Time.Interval Time), j.subinterval i ∧ μ j = m
Any interval can be subdivided to a subinterval with a given smaller measure.
Instances
Prior time span: the maximal interval right-bounded by s with
measure n. Lifted to GInterval so open-vs-closed boundary tags
are carried structurally — the prior file's pts operated on plain
Interval and the open-PTS revision was enforced only in prose.
@cite{rouillard-2026} eq. (50).
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.pts n μ s gi = (gi.right = s ∧ μ gi.toInterval = n)
Instances For
The preposition in as an event-level adverbial (E-TIA reading). The event's runtime is included in the measure-phrase's bound. @cite{rouillard-2026} eq. (62) instantiated at M = τ.
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.inETIA e bound = e.τ.subinterval bound
Instances For
E-TIA derived property: at world w, value n is true iff there is
a P-event whose runtime is included in some n-unit time, and that
n-unit time falls within g1. @cite{rouillard-2026} eq. (77).
Equations
- One or more equations did not get rendered due to their size.
Instances For
G-TIA derived property: at world w, value n is true iff there is
an OPEN PTS of measure n ending at s containing the closed
runtime of a P-event.
The openness of the PTS is now carried structurally by GInterval
rather than admitted vacuously in prose (the prior file's PERF_open
explicitly noted "the openness constraint is enforced at the level of
the G-TIA semantics rather than structurally" — i.e., not at all).
@cite{rouillard-2026} eq. (94) revised with eq. (101).
Equations
- One or more equations did not get rendered due to their size.
Instances For
The negation of gTIAPropertyOpen, used for G-TIAs in negative
contexts (where the property "no event in the n-unit open PTS" holds
iff gTIAPropertyOpen is false).
Equations
Instances For
MIP_Licensed and MIP_LicensedDown are defined in
Theories/Semantics/Entailment/Extremum.lean and reused here. They
combine Core.Scale.AdmitsOptimum P (non-constancy: the atelic
failure mode) with the per-world existence of a Set.IsLeast /
Set.IsGreatest (mathlib): a most-informative numeral exists at some
world. The two conjuncts capture two separate failure modes:
information collapse (E-TIA atelic; fails AdmitsOptimum) and
no-extremum (positive G-TIA; fails per-world IsLeast).
E-TIA information collapse for atelic VPs. When a VP has the subinterval property, the E-TIA derived property is constant: every numeral yields a true proposition at any world where any does, so no numeral is more informative than another. @cite{rouillard-2026} §4.1.1.
Atelic E-TIA fails the AdmitsOptimum half of MIP licensing.
Atelic E-TIA is not MIP-licensed.
Quantized predicates yield upward-monotone E-TIA properties.
@cite{rouillard-2026} §4.1.1: when P is telic, the derived E-TIA
property is upward monotone — the same event witnesses larger
measures via TimeMeasure.extensible.
For an upward-monotone family with a witness at some world, the
per-world set {y | P y w} has a least element via Nat.find. The
statement is in mathlib idiom (IsLeast); the cross-world IsMaxInf
bridge is in Extremum.lean (isMaxInf_of_isLeast_upward).
No smallest open PTS includes a closed runtime (geometric witness).
@cite{rouillard-2026} §4.2.2: under density on Time, given a closed
event runtime contained in an open PTS, there is always a strictly
smaller (in the proper-subinterval sense) open PTS still containing
the runtime. Construction: pick a moment between the open boundary
and the closed start.
This is the geometric density witness. The full MIP-collapse
claim "no numeral n is maximally informative for gTIAPropertyOpen"
additionally requires either rational/real-valued measure (so the
chain of ℚ-measures has no min) or threshold-rich worlds (so the
cross-world entailment leg of Semantics.Entailment.Extremum.IsMaxInf
fails at a
witness world). With the present ℕ-valued measure and no threshold
assumption, the geometric witness alone does NOT discharge
InformationCollapse (gTIAPropertyOpen ...) — at any specific
world, the smallest ℕ-measure open PTS containing the runtime
exists (it is ⌈gap⌉ + 1 for an integer-discrete model). The
empirical predictions in § 14 are stated at the polarity-and-perfect
level (matching Rouillard's Table 1) without claiming a structural
derivation through the MIP at this level of substrate generality. A
follow-up rebuild on ℚ-valued time-measure substrate (paralleling
Core.Mereology.ExtMeasure) would let the collapse argument
discharge end-to-end.
The Vendler-class boundedness pipeline used by LicensingPipeline.
NOT a claim Rouillard makes about Kennedy adjectival scales (the prior
file's "Kennedy–Rouillard isomorphism" framing was a formaliser
invention not present in the paper); this is the codebase's
mereological-tag chain (Features.Aktionsart) consumed here for the
empirical predictions in § 13. The chain
VendlerClass →.telicity Telicity →.toMereoTag MereoTag →.toBoundedness Boundedness
is definitional, with LicensingPipeline VendlerClass registered in
Features/Aktionsart.lean.
Telic VPs route through LicensingPipeline to the licensed (closed)
boundedness tag.
Atelic VPs route through LicensingPipeline to the unlicensed (open)
boundedness tag.
Rouillard's TIA-type classification. Paper-specific apparatus
(per feedback_fragment_schema_consensus_only); not on Fragment
entries themselves.
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableEqTIAType 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
Rouillard's syntactic position for the in-adverbial. E-TIAs are VP-adjacent (event-level); G-TIAs are AspP-adjacent (perfect-level). @cite{rouillard-2026} §3.2, schemata (57)/(61).
- eventLevel : AdverbialPosition
- perfectLevel : AdverbialPosition
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableEqAdverbialPosition 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
Bundle of Rouillard's analytical labels for an in-adverbial.
- tiaType : TIAType
- position : AdverbialPosition
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Project a DurationExprEntry to Rouillard's analytical labels.
Returns none for entries outside the in-adverbial paradigm
(forDur, ago). Co-located in this Studies file (NOT
_root_.Fragments.…) per the audit's namespace-discipline finding.
Equations
- One or more equations did not get rendered due to their size.
Instances For
E-TIA acceptability datum: VP class → acceptable with E-TIA?
Acceptability is a Prop field (was Bool in the prior file —
the project memory feedback_no_intrinsic_bool.md discourages
propositional Bool).
- vp : String
Description of the VP
- vendlerClass : Features.VendlerClass
Vendler class of the VP
- acceptable : Prop
Whether "VP in three days" is acceptable
- acceptableDecidable : Decidable self.acceptable
Instances For
(1a) "Mary wrote up a paper in three days." — accomplishment, ✓
Equations
- One or more equations did not get rendered due to their size.
Instances For
(1b) "*Mary was sick in three days." — state, ✗
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.datum_1b = { vp := "be sick", vendlerClass := Features.VendlerClass.state, acceptable := False, acceptableDecidable := instDecidableFalse }
Instances For
(88) "The climber reached the summit in three days." — achievement, ✓
Equations
- One or more equations did not get rendered due to their size.
Instances For
(84) "*The dancers waltzed in one hour." — activity, ✗
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.datum_84 = { vp := "waltz", vendlerClass := Features.VendlerClass.activity, acceptable := False, acceptableDecidable := instDecidableFalse }
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
E-TIA acceptability matches the boundedness prediction:
LicensingPipeline.toBoundedness d.vendlerClass is licensed iff
the datum is acceptable. The pipeline routes through the
Telicity → MereoTag → Boundedness chain (§ 11).
Equations
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableETIA_predicted d = id inferInstance
G-TIA acceptability datum: polarity × perfect → acceptable.
- sentence : String
Description of the sentence
- isNegative : Prop
Is the sentence negative?
- isNegativeDecidable : Decidable self.isNegative
- hasPerfect : Prop
Does the sentence contain a perfect?
- hasPerfectDecidable : Decidable self.hasPerfect
- acceptable : Prop
Whether the G-TIA is acceptable
- acceptableDecidable : Decidable self.acceptable
Instances For
(2a) "Mary hasn't been sick in three days." — negative perfect, ✓
Equations
- One or more equations did not get rendered due to their size.
Instances For
(2b) "*Mary has been sick in three days." — positive perfect, ✗
Equations
- One or more equations did not get rendered due to their size.
Instances For
(48) "*Mary wasn't sick in three days." — negative, no perfect, ✗
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
G-TIA acceptability matches the polarity ∧ perfect prediction. @cite{rouillard-2026} Table 1: only NEG + PFV with G-TIA reading survives MIP filtering. The structural derivation through MIP requires either rational-valued measure or threshold-rich worlds (see § 9 docstring); the prediction is stated here at the surface polarity-and-perfect level matching Rouillard's empirical claim.
Equations
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableGTIA_predicted d = id inferInstance
@cite{rouillard-2026} Table 1: readings for "Mary has been sick in three days" and its negation crossed with TIA type and aspect.
Polarity, TIA type, and aspect are enums (not Bool flags), so the table reads structurally rather than as a tuple of opaque booleans.
- positive : Table1Polarity
- negative : Table1Polarity
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableEqTable1Polarity 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
- pfv : Table1Aspect
- impv : Table1Aspect
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableEqTable1Aspect 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
- polarity : Table1Polarity
- tiaType : TIAType
- aspect : Table1Aspect
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
A Table 1 cell survives MIP filtering iff it is the unique NEG + G-TIA + PFV configuration. Derived (not stipulated): every other cell is blocked by Rouillard's account, by various information-collapse mechanisms (positive cells: open-PTS density; E-TIA cells under negation: aspect mismatch with perfect; IMPV cells: U-perfect quantification mismatch).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableTable1Survives c = id inferInstance
All 8 Table 1 cells, generated by enumerating the three discriminators.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@cite{rouillard-2026} Table 1: exactly one cell survives — NEG + G-TIA + PFV.
@cite{rouillard-2026} §3.2, ex. (60). When two TIAs stack, the inner
(VP-adjacent) one must be E-TIA and the outer must be G-TIA. The
reverse order is ungrammatical. The position constraint follows from
AdverbialPosition: E-TIA = eventLevel (VP-adjacent), G-TIA =
perfectLevel (AspP-adjacent).
TIA stacking datum: inner and outer adverbial classifications.
- sentence : String
- innerType : TIAType
- innerPosition : AdverbialPosition
- outerType : TIAType
- outerPosition : AdverbialPosition
- acceptable : Prop
- acceptableDecidable : Decidable self.acceptable
Instances For
(60a) "Mary hasn't written up a paper in three days in two weeks." Inner E-TIA + outer G-TIA: acceptable.
Equations
- One or more equations did not get rendered due to their size.
Instances For
(60b) "#Mary hasn't written up a paper in two weeks in three days." Reversed order: unacceptable.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Stacking is acceptable iff inner is event-level and outer is perfect-level. @cite{rouillard-2026} §3.2 schemata (57), (61).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Phenomena.TenseAspect.Studies.Rouillard2026.instDecidableStacking_predicted d = id inferInstance
@cite{rouillard-2026} §5.2, ex. (131): "Since when has Mary been sick?" lacks the E-perfect/U-perfect ambiguity of the corresponding declarative. Rouillard derives this from MIP applied to the Hamblin set (eq. 135 ANS): the E-perfect Hamblin set has no maximally informative true answer (open-PTS density argument), the U-perfect Hamblin set does.
The since-when observation itself is originally
@cite{von-fintel-iatridou-2019}'s "Since *since*"; the explanatory
mechanism (open-PTS density on dense time) is from
@cite{fox-hackl-2006}'s Universal Density of Measurement.
(131) "Since when has Mary been sick?" — U-perfect only.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Since-when questions block the E-perfect reading. @cite{fox-hackl-2006} density argument applied to Rouillard's eq. (137) E-perfect Hamblin set: no maximally informative true answer survives MIP filtering.
Fragment bridge: since is veridical and pins the PTS left boundary, matching the since-when question's presupposition.
The Rouillard projection assigns the expected analytical labels: E-TIA at event-level for telic-completion in; G-TIA at perfect-level for the NPI-gap in.
Out-of-paradigm entries return none: for and ago are duration
adverbials but not in-adverbials.