115

Feasibly constructive proofs and the propositional calculus
– Stephen Cook
 1975

121

Bounded Arithmetic, Bibliopolis
– S R Buss
 1986

29

RSUV isomorphism
– G Takeuti
 1993

54

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

80

Counting problems in bounded arithmetic
– Jeff B Paris, Alex J Wilkie

58

Notes on Polynomially Bounded Arithmetic
– Domenico Zambella

211

Bounded Arithmetic, Propositional Logic, and Complexity Theory
– J Krajíček
 1995

22

Fragments of bounded arithmetic and bounded query classes
– J Krajíček
 1993

57

Bounded arithmetic and the polynomial hierarchy
– J Krajíček, P Pudlák, G Takeuti
 1991

27

Relating the Bounded Arithmetic and Polynomial Time Hierarchies
– Samuel R. Buss, Then T
 1994

28

An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic
– Alexander A. Razborov
 1993

35

Witnessing Functions in Bounded Arithmetic and Search Problems
– Mario Chiari, Jan Krajicek
 1994

71

A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes
– J B Paris, A J Wilkie, Woods
 1988

29

FirstOrder Proof Theory of Arithmetic
– Samuel R. Buss
 1998

46

Bounded Arithmetic and Lower Bounds in Boolean Complexity
– Alexander A. Razborov
 1993

123

Exponential lower bounds for the pigeonhole principle
– Paul W Beame, Toniann Pitassi, Russel Impagliazzo
 1993

67

An Exponential Lower Bound to the Size of Bounded Depth Frege . . .
– Jan Krajícek , Pavel Pudlák, Alan Woods
 1994

237

Almost Optimal Lower Bounds for Small Depth Circuits
– Johan Håstad
 1989

18

Provably Total Functions in Bounded Arithmetic Theories . . .
– Samuel Buss, J. Kpajfcek, P. Pudlk, G. Takeuti, Bounded Arithmetic
 1992
