1. The monotone circuit complexity of Boolean functions;Alon;Combinatorica,1987
2. Eliminating definitions and Skolem functions in first-order logic;Avigad;ACM Transactions of Computational Logic,2002
3. The complexity of the disjunction and existence properties in intuitionistic logic;Buss;Annals of Pure and Applied Logic,1999
4. On the computational content of intuitionistic propositional proofs;Buss;Annals of Pure and Applied Logic,2001
5. Lower bounds for modal logics;Hrubeš;Journal of Symbolic Logic,2007