Verified65% confidenceFactExact time
The Lean formal proof assistant operates on the basis of type theory and the Curry–Howard correspondence, and every proof step must be verified by the kernel's type checker
3
Sources
65%
Confidence
Long-term
Relevance
8/9/2026
First Seen
Sources
AI反例被证伪：Connes刚性定理事件揭示的数学推理真相
Related Claims
VerifiedLean requires that every step of derivation be written in a strict type-theoretic language, with logical completeness automatically verified by a computational kernel.78% similarVerifiedOnly when a proof passes the rigorous type-checking of proof assistants such as Lean can its conclusions be trusted; combining AI output with formal verification tools is the key pathway to ensuring mathematical correctness.77% similarVerifiedTheorem provers such as Lean, Coq, and Isabelle require every reasoning step to be translated into strict logical notation and automatically checked for compliance.77% similarUnverifiedThe core principle of interactive theorem provers is built on the Curry–Howard correspondence, whereby propositions correspond to types and proofs correspond to programs that satisfy those types.77% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/713770API
curl https://kongchang.com/api/v1/knowledge/claims/713770MCP
get_claim(id=713770)