Elicitability
Mathematics verified. Core theorems are machine-checked in Lean 4.
Prose and presentation may not have been human-reviewed.
Abstract
#9 Elicitability Resolution — Coherence vs Elicitability.
This paper presents 35 machine-verified theorems building on 0 established facts and 68 hypotheses. All results are formally verified in the Lean 4 (153 verification units, 35 proved statements) and exportable to Lean 4.
<!-- TODO: Write a proper abstract summarizing the key contributions -->
Length
852 words
Claims
33 theorems
Status
Skeleton
Novelty
No discernible intellectual delta — the paper is a skeleton with theorem statements but no proofs, no exposition, no definitions, and no abstract; the claimed 'resolution' of coherence vs elicitability is stated but not developed.