Institutional Repository
| structure of proofs and the complexity of cut elimination | |
| Zhang Wenhui | |
| 2006 | |
| Source | Theoretical Computer Science
 |
| Volume | 353Issue:40181Pages:63-70 |
| Indexed Type | sciencedirect |
| Department | 计算机科学国家重点实验室 |
| WOS ID | WOS:000236230100004 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/4646 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Zhang Wenhui. structure of proofs and the complexity of cut elimination[J]. Theoretical Computer Science,2006,353(40181):63-70. |
| APA | Zhang Wenhui.(2006).structure of proofs and the complexity of cut elimination.Theoretical Computer Science,353(40181),63-70. |
| MLA | Zhang Wenhui."structure of proofs and the complexity of cut elimination".Theoretical Computer Science 353.40181(2006):63-70. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 2.pdf（181KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment