58

Notes on Polynomially Bounded Arithmetic
– Domenico Zambella

211

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

115

Feasibly constructive proofs and the propositional calculus
– Stephen Cook
 1975

274

Descriptive Complexity
– Neil Immerman
 1998

17

A secondorder system for polytime reasoning based on Grädel's theorem
– Stephen Cook, Antonina Kolokolova
 2001

10

The strength of replacement in weak arithmetic
– Stephen Cook, Neil Thapen
 2004

19

Foundations of proof complexity: Bounded arithmetic and propositional translations, Book in progress, Available from http://www.cs.toronto.edu/˜sacook
– Stephen A Cook, Phuong Nguyen

121

Bounded Arithmetic, Bibliopolis
– S R Buss
 1986

10

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

29

FirstOrder Proof Theory of Arithmetic
– Samuel R. Buss
 1998

27

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

10

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

12

A bounded arithmetic AID for Frege systems
– Toshiyasu Arai

78

Lectures on Proof Theory
– Samuel Buss, A. Maciel (mcgill, E. Allender (rutgers, P. Mckenzie
 1996

330

The relative efficiency of propositional proof systems
– Stephen A. Cook, Robert, A. Reckhow
 1979

28

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

66

The Boolean formula value problem is in ALOGTIME
– Samuel R. Buss
 1987

13

Logical Approaches to the Complexity of Search Problems
– Tsuyoshi Morioka
 2005

41

Capturing Complexity Classes by Fragments of Second Order Logic, Theoretical Computer Science 101
– E Gradel
 1992
