10

Disjoint NPPairs and . . .
– Olaf Beyersdorff

86

Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic
– Jan Krajícek

45

Predicative Recursion and Computational Complexity
– Stephen J. Bellantoni
 1992

21

The complexity of propositional proofs
– Nathan Segerlind


Expressing vs. proving: relating forms of complexity in logic
– Antonina Kolokolova


Weak Pigeonhole Principle, and Randomized Computation
– Emil Jerábek
 2005

27

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

18

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

30

Theories for Complexity Classes and their Propositional Translations
– Stephen Cook
 2004


On the Lengths of Proofs of Consistency  a Survey of Results
– Pavel Pudlák

13

Relating the PSPACE reasoning power of Boolean Programs and Quantified Boolean Formulas
– Alan Skelley
 2000

6

A Fundamental Problem of Mathematical Logic
– Jan Krajicek

88

Functional interpretations of feasibly constructive arithmetic
– Stephen Cook, Alasdair Urquhart
 1993

8

The provable total search problems of bounded arithmetic
– Alan Skelley, Neil Thapen
 2007

1

Higher complexity search problems for bounded arithmetic and
– Neil Thapen
 2010

35

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

3

Bounded Arithmetic and Constant Depth Frege Proofs
– Samuel R. Buss
 2004


Extensions of Models of PV
– Jan Krajicek

3

Bounded arithmetic, cryptography, and complexity
– Samuel R. Buss
 1997
