###
DOI:
Journal of Software:1994.5(10):33-37

一个新的证明网定义及合理性
黄林鹏,孙永强
(上海交通大学计算机系,上海 200030)
A NEW DEFINITION OF PROOF-NETS
Huang Linpeng,Sun Yongqiang
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2588   Download 2524
Received:December 12, 1991    Revised:June 13, 1992
> 中文摘要: 本文给出一个新的线性逻辑的证明网的定义并证明了所定义的证明网是线性逻辑的自然推理.和Girard的原定义相比,使用本文给出的定义来判定一个证明结构是否为证明网的时间复杂度为O(n*n),并且在证明所定义的证明网是可矢列化时更加自然和简单.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Reference text:

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

Huang Linpeng,Sun Yongqiang.A NEW DEFINITION OF PROOF-NETS.Journal of Software,1994,5(10):33-37