37

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

326

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

10

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

21

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

14

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

560

Untersuchungen über das logische Schliessen. Mathematische Zeitschrift 39
– G Gentzen
 1935

31

On the Proof Complexity of Deep Inference
– Paola Bruscoli, Alessio Guglielmi
 2000

31

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

9

Proof Theory. Studies in Logic 81
– G Takeuti
 1987

7

Some combinatorics behind proofs
– A Carbone
 1995

47

Brünnler and Alwen Fernanto Tiu. A local system for classical logic
– Kai
 2001

81

Existence and feasibility in arithmetic
– R Parikh
 1971

6

Turning Cycles into Spirals
– A. Carbone
 1999

84

A system of interaction and structure
– Alessio Guglielmi
 2004

4

Interpolants, Cut Elimination and Flow Graphs . . .
– A. Carbone
 1997

297

On the complexity of derivation in the propositional calculus
– G S Tseitin
 1968

6

Proofs and groups with distorted length function. Unpublished manuscript
– A Carbone
 1996

8

Cycling in proofs and feasibility
– A. Carbone
 1998

50

The Lengths of Proofs
– Pavel Pudlák
 1998
