21

Lower bounds for increasing complexity of derivations after cut elimination
– V P Orevkov
 1979

10

Making proofs without modus ponens: An introduction to the combinatorics and complexity of cut elimination
– A Carbone, S Semmes
 1997

14

Proof Theory and Logical Complexity, volume 1
– JY Girard
 1987

27

The Undecidability of kProvability
– Samuel R. Buss
 1989

37

Bounds for proofsearch and speedup in the predicate calculus
– Richard Statman
 1978

8

Cycling in proofs and feasibility
– A. Carbone
 1998

50

The Lengths of Proofs
– Pavel Pudlák
 1998

565

Untersuchungen über das logische Schließen
– G Gentzen
 1935

8

A Graphic Apology for Symmetry and Implicitness
– A Carbone, S Semmes
 2000

11

Duplication of Directed Graphs and Exponential Blow Up of Proofs
– A. Carbone
 1999

303

On the complexity of derivation in propositional calculus
– Grigori Tseitin
 1968

9

Proof Theory. Studies in Logic 81
– G Takeuti
 1987

264

The intractability of resolution
– A Haken
 1985

330

The relative efficiency of propositional proof systems
– Stephen A. Cook, Robert, A. Reckhow
 1979

31

Interpolants, cut elimination and flow graphs for the propositional calculus
– A Carbone
 1997

35

bounds on Herbrand’s theorem
– R Statman, Lower
 1979

10

Complexity of proofs and their transformations in axiomatic theories, volume 128 of Translations of Mathematical Monographs
– V P Orevkov
 1993

5

Asymptotic cyclic expansion and bridge groups of formal proofs
– A. Carbone
 2001

7

Some combinatorics behind proofs
– A Carbone
 1995
