Cross-framework synthesis: cumulative readings of modified numerals #
@cite{charlow-2021} @cite{beck-sauerland-2000} @cite{champollion-2017} @cite{schein-1993}
Why this file exists #
Three rival accounts of cumulative readings live in three different directories and (until this file) never spoke to each other:
| Account | Mechanism | Location |
|---|---|---|
| Tower continuations | Higher-order dynamic GQ via Cont monad | Phenomena/Plurals/Studies/Charlow2021/HigherOrder.lean |
Beck-Sauerland ** | Pluralization operator on relations between Finsets | Theories/Semantics/Plurality/Cumulativity.lean |
Champollion * | Cumulative-closure on event predicates | Theories/Semantics/Events/Aspect/Cumulativity.lean |
Linglib's stated thesis: theoretical incompatibilities should be made visible. Three accounts of the same phenomenon, formalized side-by-side without bridge theorems, fails that test. The 4-agent Quantification/ audit (2026-04-28) flagged this as the directory's loudest silent divergence.
Status #
Stub. This file collects the three accounts in one import graph but the substantive cross-framework theorems are deferred to a follow-up session. The bridge questions:
- Tower-continuation
cumulativeTower v u boys movies saw' = ?Beck-Sauerland'sCumulative (fun b m => saw b m) (boys.toFinset) (movies.toFinset)? Both purport to express "every boy saw at least one movie AND every movie was seen by at least one boy"; equivalence holds on the obvious shared scenario but the type-level packaging differs (DRS-state-threading vs Bool-valued Finset relation). - Beck-Sauerland
**↔ Champollion*: B&S pluralizes the relation; CHP pluralizes each predicate and propagates viaIsCumThetaVerb. The scenarios where they diverge involve dependent indefinites and incremental themes — exactly the cases where Charlow's tower system claims advantage.
TODO #
- Pick a shared concrete scenario (e.g., 3 boys × 5 movies ×
saw). - State
tower_eq_BeckSauerland_on_scenarioandBS_eq_Champollion_on_scenarioas decidable equalities. Each likely needs adecide-friendly reformulation of the tower output. - Identify a scenario where they diverge (dependent indefinite or per-event reading) — this is the substantive contribution.
For now the file just guarantees the three accounts compile in the same import-graph, which is the precondition for stating bridge theorems.