THE COMPLEXITY OF FORMAL PROVING

被引：0
|
作者：
洪加威
机构：
[1] Beijing Computer
来源：
ScienceinChina,SerA. | 1984年 / Ser.A.1984卷 / 10期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
<正> In this paper, conceptions of the length, the depth and the width of a proof in a formalsystem are proposed. It is proved that the depth, the width and the logarithm of the lengthare linearly related to each other. Therefore, the proof of any theorem can be highly paral-lelized, which is a completely different conclusion from deterministic computation.
引用
收藏
页码：1046 / 1054
页数：9
相关论文
共 50 条
12345