Formal Proof Sketches
Formal Proof Sketches
复制标题
形式证明草图
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
F. Wiedijk
中科院分区：
文献类型：
--
作者：
F. Wiedijk
形式化数学目前看起来不太像非形式数学。此外，形式化数学目前似乎太多的工作，不值得工作的数学家的时间。为了解决这两个问题，我们引入了正式证明草图的概念。这是一种介于完全可检查的形式证明和根本没有任何证明的陈述之间的证明表示。虽然一个形式证明草图是太高的水平，无法通过计算机检查，它有一个精确的概念的正确性（因此形容词形式）。
Formalized mathematics currently does not look much like informal mathematics. Also, formalizing mathematics currently seems far too much work to be worth the time of the working mathematician. To address both of these problems we introduce the notion of a formal proof sketch. This is a proof representation that is in between a fully checkable formal proof and a statement without any proof at all. Although a formal proof sketch is too high level to be checkable by computer, it has a precise notion of correctness (hence the adjective formal).