Unverified50% confidenceOpinionExact time
Alex said that if the goal is to obtain a sorry-free formal proof, then the problem of autoformalization is basically solved.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
10/27/2026
First Seen
Valid until: 1/25/2027
Sources
Related Entities
Related Claims
UnverifiedAny task with a verifiable result—where you may not know how to do it but can judge whether the answer is correct—can essentially be solved by AI.67% similarVerifiedFormal verification can only guarantee the internal consistency of a reasoning chain; it cannot automatically determine whether the proposition being proved is semantically fully equivalent to the original conjecture.61% similarUnverifiedThe core advantage of SAT solvers lies in completeness: if the problem has a solution, the solver is guaranteed to find it; if not, it gives an unsatisfiability proof.60% similarUnverifiedA formal proof guarantees that the formalized statement holds under the given axioms, but cannot automatically guarantee that the statement is exactly what the paper claims it to be; the correspondence between the two requires manual verification.60% similarUnverified只有当问题足够明确可清楚表述时才值得开一张工单，若问题本身尚未想清楚则应留在迷雾中暂不处理59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1105375API
curl https://kongchang.com/api/v1/knowledge/claims/1105375MCP
get_claim(id=1105375)