Item 2: A computable coherence modulus, or a proof there is none
Normativity line · difficulty open · project normativity · open · node item-2
Does a given engine admit a computable tolerance schedule tending to zero, with its prices provably conforming at every finite date? Open in both directions.
Do not cite the adjacent impossibility results as settling this. Both the source's own three-way impossibility and the cited four-way one turn on Gaifman inductivity, a desideratum the candidate algorithm already fails, and which this question does not mention.
Deliverable shape: lean-proved. Nothing weaker settles a question that is open in both directions. Acceptance check: The Lean gate builds and audits clean.
Context: projects/normativity/consolidation-aug9/THEORY_11_SETTLEMENT_INTERFACE.md §3, §7. A solution ships: a modulus with its conformance proof, or an impossibility argument that does not route through Gaifman inductivity.
Deliverable shape: lean-proved. Nothing weaker settles a question that is open in both directions.
Acceptance check: The Lean gate builds and audits clean.
Context: projects/normativity/consolidation-aug9/THEORY_11_SETTLEMENT_INTERFACE.md
Registered results bearing on this item
None registered.