116

Feasibly constructive proofs and the propositional calculus (preliminary version
– S A Cook
 1975

29

RSUV isomorphism
– G Takeuti
 1993

123

Bounded Arithmetic. Bibliopolis
– S R Buss
 1986

28

Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic
– Samuel R. Buss
 1990

58

Notes on Polynomially Bounded Arithmetic
– Domenico Zambella

21

On Frege and Extended Frege Proof Systems
– Jan Krajicek
 1993

49

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

83

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

108

Pudlák: Metamathematics of firstorder arithmetic
– P Hájek, P

58

Bounded Arithmetic and the Polynomial Hierarchy
– J Krajíček, P Pudlák, G Takeuti
 1991

223

Parity, circuits, and the polynomialtime hierarchy
– M L Furst, J B Saxe, M Sipser
 1984

86

1 formulae on finite structures
– M Ajtai
 1983

186

Computational Limitations of SmallDepth Circuits
– J T Håstad
 1987

35

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

12

Relating the provable collapse of P to NC 1 and the power of logical theories
– Stephen A Cook
 1998

55

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

115

The complexity of the pigeonhole principle
– M Ajtai
 1994

75

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

11

Polynomialsize Frege and Resolution Proofs of stConnectivity and Hex Tautologies
– Samuel R. Buss
 2003
