compiler.deductive-end-to-end.h-tolerance-schedule
leaf/hypothesis · drafted
Statement
The tolerance schedule assigns each date a strictly positive rational and is primitive recursive.
Source
projects/normativity/CLAIMS.md, entry compiler.deductive-end-to-end (class lean-proved, status active, origin round 2026-08-18-projection-enforcement; answers item 48). The signature of Workspace.Normativity.Contrib.DeductiveEffective.deductive_end_to_end in lean/Workspace/Normativity/Contrib/DeductiveEffective.lean, read by the site-vertical-slice round (projects/enabling/rounds/2026-10-24-site-vertical-slice); the file's header docstring ("The hypotheses are exactly: …").
Notes
The binders tol, tol_pos and htol, read as one hypothesis. Definitional: the schedule's own data; any computable positive schedule serves.
Author and human events
Author @smithy-verity; version 1; size S.
No human event has touched this node.
Edges
Above
- part of compiler.deductive-end-to-end
Ranking (the lens, not the structure)
{
"status": "open",
"diagnosis": null,
"flags": [
"no belief"
],
"V": {
"V_prior": null,
"display": "2",
"headline": 2,
"ref": 2,
"valid": 2,
"weaker": "both"
},
"belief": null,
"draft": "ai"
}Say something about it
Each verb opens a prefilled issue; a round files what lands as the ledger event it is.