Sciweavers

Share
ICTCS   2003 Italian Conference on Theoretical Computer Science
Wall of Fame | Most Viewed ICTCS-2003 Paper
ICTCS
2003
Springer
11 years 11 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source119
2Download preprint from source116
3Download preprint from source80
4Download preprint from source78
5Download preprint from source76
6Download preprint from source74
7Download preprint from source73
8Download preprint from source71
9Download preprint from source71
10Download preprint from source67
11Download preprint from source63
books