115

Feasibly constructive proofs and the propositional calculus
– Stephen Cook
 1975

81

On existence and feasibility in arithmetic
– R Parikh
 1971

330

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

151

The intrinsic computational difficulty of functions
– A Cobham
 1965

50

Algebras of feasible functions
– Yuri Gurevich
 1983

57

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

88

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

80

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

269

Relational Queries Computable in Polynomial Time
– Neil Immerman
 1986

123

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

71

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

179

A New RecursionTheoretic Characterization Of The Polytime Functions
– Stephen Bellantoni, Stephen Cook
 1992

84

Pudlák: Propositional proof systems, the consistency of first order theories and the complexity of computations
– J Krajíček, P
 1989

80

Fixedpoint extensions of firstorder logic
– Y Gurevich, S Shelah
 1985

230

Languages That Capture Complexity Classes
– Neil Immerman
 1987

25

On Spectra
– J H Bennett
 1962

23

Polynomial Time Computable Arithmetic and Conservative Extensions
– Fernando Ferreira
 1988

54

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

66

Theory of Formal Systems
– R Smullyan
 1961
