10

Bounded Arithmetic and Propositional Proof Complexity
– Samuel R. Buss
 1995

30

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

8

Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic
– Arnold Beckmann, Samuel R. Buss
 2008

2

A BottomUp Approach to Foundations of Mathematics
– Pavel Pudlak

8

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

15

How to Lie Without Being (easily) Convicted and the Lengths of Proofs in Propositional Calculus
– Pavel Pudlák, Samuel R. Buss

18

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

3

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

9

Quantified Propositional Calculus and a SecondOrder Theory for NC¹
– Stephen Cook, Tsuyoshi Morioka
 2004


A Propositional Proof System for. . .
– Chris Pollett


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

2

Ordinal Notations and WellOrderings in Bounded Arithmetic
– Arnold Beckmann, Samuel R. Buss, Chris Pollett
 2002

1

Consistency and Gamesin Search of New Combinatorial Principles
– Pavel Pudlák
 2004

45

Predicative Recursion and Computational Complexity
– Stephen J. Bellantoni
 1992

27

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

54

Unprovability of Lower Bounds on the Circuit Size in Certain Fragments of Bounded Arithmetic
– Er A. Razborov
 1995

10

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

5

Separation Results for the Size of ConstantDepth Propositional Proofs
– Arnold Beckmann, Samuel R. Buss
 2004

4

Separating daglike and treelike proof systems
– Phuong Nguyen
 2007
