571

19341935), “Untersuchungen Uber das logische Schliessen
– Gerhard Gentzen

81

Counting problems in bounded arithmetic
– J Paris, A Wilkie
 1985

55

An application of boolean complexity to separation problems in bounded arithmetic
– Samuel R. Buss, Jan Krajlcek
 1994

44

Normal derivability in classical logic
– W W Tait
 1968

25

Notation systems for infinitary derivations
– Wilfried Buchholz
 1991

23

Fragments of Bounded Arithmetic and Bounded Query Classes
– J Krajíček
 1993

18

Structure and Definability in General Bounded Arithmetic Theories
– Chris Pollett
 1999

17

Finite investigations of transfinite derivations
– Grigori E Mints
 1978

12

Explaining Gentzen’s consistency proof within infinitary proof theory
– W Buchholz
 1997

10

Bounded Arithmetic, volume 3
– Samuel R Buss
 1986
