THE COMPLEXITY OF FORMAL PROVING

被引:0
|
作者
洪加威
机构
[1] Beijing Computer
关键词
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 条
  • [31] Formal complexity in digital architecture
    Hatzellis, S.
    Digital Architecture and Construction, 2006, 90 : 51 - 58
  • [32] COMPLEXITY THEORY AND FORMAL LANGUAGES
    LANGE, KJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 19 - 36
  • [33] Topological complexity of formal spaces
    Lechuga, Luis
    Murillo, Aniceto
    TOPOLOGY AND ROBOTICS, 2007, 438 : 105 - +
  • [34] COMPUTATIONAL COMPLEXITY OF FORMAL TRANSLATIONS
    HARTMANIS, J
    MATHEMATICAL SYSTEMS THEORY, 1975, 8 (02): : 156 - 166
  • [35] Descriptional Complexity of Formal Systems
    Juergensen, Helmut
    Karhumaki, Juhani
    Okhotin, Alexander
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 1 - 1
  • [36] FORMAL METHODS COPE WITH COMPLEXITY
    MALINIAK, L
    ELECTRONIC DESIGN, 1995, 43 (23) : 22 - 22
  • [37] Extension Complexity of Formal Languages
    Tiwary, Hans Raj
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (05) : 735 - 753
  • [38] Symmetry vs. complexity in proving the MullerSatterthwaite theorem
    Ninjbat, Uuganbaatar
    ECONOMICS BULLETIN, 2012, 32 (02): : 1434 - 1441
  • [39] The complexity of proving chaoticity and the Church-Turing thesis
    Calude, Cristian S.
    Calude, Elena
    Svozil, Karl
    CHAOS, 2010, 20 (03)
  • [40] The Research on Formal Verification of CPU Structure Based on Theorem Proving
    Yang, Hongwei
    Ma, Dianfu
    PROCEEDINGS OF 2019 IEEE 10TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2019), 2019, : 139 - 143