LICS 1995 Symposium on Logic in Computer Science
 |  |
Wall of Fame | Most Viewed LICS-1995 Paper
LICS
1995
IEEE
13 years 8 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 156 | ||
| 2 | | 154 | ||
| 3 | | 111 | ||
| 4 | | 102 | ||
| 5 | | 88 | ||
| 6 | | 82 | ||
| 7 | | 79 | ||
| 8 | | 73 |