Cut-Elimination by Resolution (1999)
by
M. Baaz
,
A. Leitsch
| Venue: | J. SYMBOLIC COMPUTATION |
| Citations: | 1 - 1 self |
BibTeX
@ARTICLE{Baaz99cut-eliminationby,
author = {M. Baaz and A. Leitsch},
title = {Cut-Elimination by Resolution},
journal = {J. SYMBOLIC COMPUTATION},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 493 | Untersuchungen über das logische Schließen - Gentzen - 1935 |
| 135 | Basic Proof Theory - Troelstra, Schwichtenberg - 2000 |
| 30 | bounds on Herbrand’s theorem - Statman, ‘Lower - 1979 |
| 19 | Lower bounds for increasing complexity of derivations after cut elimination - Orevkov - 1982 |
| 5 | Fast Cut-Elimination by Projection - Baaz, Leitsch - 1996 |
