| 摘要: |
| 本文给出一个新的线性逻辑的证明网的定义并证明了所定义的证明网是线性逻辑的自然推理．和Ｇｉｒａｒｄ的原定义相比，使用本文给出的定义来判定一个证明结构是否为证明网的时间复杂度为Ｏ（ｎ＊ｎ），并且在证明所定义的证明网是可矢列化时更加自然和简单． |
| 关键词: 线性逻辑，证明网，并行计算 |
| DOI： |
| 分类号: |
| 基金项目: |
|
| A NEW DEFINITION OF PROOF-NETS |
|
Huang Linpeng,Sun Yongqiang
|
| 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. |
| Key words: Linear logic, proof-nets, parallel computation. |
