On lengths of proofs in non-classical logics

The monotone circuit complexity of boolean functions

Noga Alon, Ravi B. Boppana · COMBINATORICA · 1987 · 345 citations

Circuit Complexity, Engineering, Boolean Function +4

Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic

Jan Krajı́ček · Journal of Symbolic Logic · 1997 · 296 citations

Circuit Complexity, Computational Complexity Theory, Engineering +20

Polynomial size proofs of the propositional pigeonhole principle

Samuel R. Buss · Journal of Symbolic Logic · 1987 · 192 citations

Pigeonhole Principle, Engineering, Polynomial Size Proofs +11

A lower bound for intuitionistic logic

Pavel Hrubeš · Annals of Pure and Applied Logic · 2007 · 46 citations

Intuitionistic Logic, Non-classical Logic, Fuzzy Logic +4

Lower bounds for modal logics

Pavel Hrubeš · Journal of Symbolic Logic · 2007 · 40 citations

Engineering, Substructural Logic, Automated Reasoning +9