• Article
  • | |
  • Metrics
  • |
  • Reference [1]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    This paper presents a new definition of proof-net and proves that what the authors defined is the "natural deduction of linear logic". The complealty of deciding whether a given proof structure is a proof-net by definition is O(n * n), by the way, the proof of sequentialization of proof-nets so defined is very natural and simple.

    Reference
    1 Girard J Y.Linear logic.T.C.S.,1987,50:1—101. 2 黄林鹏,孙永强.一个时间复杂度为O(n*n)的证明网验证算法.“双B”代数和计算机逻辑论文集,第二届全国计算机逻辑学术研讨会。苏州:上海交通大学出版社,1991:125—131. 3 Girard J Y.Towards a geometry of interaction.Contemporary Mathematics,1989,92:69—108. 4 黄林鹏,孙永强.线性逻辑导论.计算机科学,1991(1):15—19.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

黄林鹏,孙永强.一个新的证明网定义及合理性.软件学报,1994,5(10):33-37

Copy
Share
Article Metrics
  • Abstract:3715
  • PDF: 4395
  • HTML: 0
  • Cited by: 0
History
  • Received:December 12,1991
  • Revised:June 13,1992
You are the first2045182Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063