How to Believe a Machine-Checked Proof¶
Pollack, R. (1998). How to Believe a Machine-Checked Proof. Twenty Five Years of Constructive Type Theory.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Proof-Assistant Kernel Check
- The kernel certifies a proof in its logic, so a bug in the kernel, an inconsistent axiom the user added, or a mismatch between the formal statement and the informal theorem the mathematician meant all pass without complaint — the check is only as meaningful as the statement it binds to
This sourceSeparates machine verification of derivability in a stated formal system from trust in the checker implementation and from the human task of confirming that the formal statement expresses the intended theorem.
- The kernel certifies a proof in its logic, so a bug in the kernel, an inconsistent axiom the user added, or a mismatch between the formal statement and the informal theorem the mathematician meant all pass without complaint — the check is only as meaningful as the statement it binds to
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:e8907a1d7e74 · see in the full table