A simple proof of a theorem of Statman

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

The polynomial-time hierarchy

Larry J. Stockmeyer · Theoretical Computer Science · 1976 · 1.3K citations

J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.

Journal of Symbolic Logic · 1988 · 352 citations

Natural Sciences, Mathematics, Algebra +4

The typed λ-calculus is not elementary recursive

Richard Statman · Theoretical Computer Science · 1979 · 162 citations · Full text

Computing, Computer Science, Programming Languages +11

A theory of propositional types

Leon Henkin · Fundamenta Mathematicae · 1963 · 110 citations

Humanities, Computer Science, Logic +9