The monotone circuit complexity of Boolean functions
Combinatorica
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Exponential lower bounds for the pigeonhole principle
Computational Complexity
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle
Random Structures & Algorithms
Some consequences of cryptographical conjectures for S12 and EF
Information and Computation - Special issue: logic and computational complexity
Lower bounds for the polynomial calculus
Computational Complexity
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Modal logic
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
On the lengths of proofs in the propositional calculus.
On the lengths of proofs in the propositional calculus.
Pseudorandom Generators in Propositional Proof Complexity
SIAM Journal on Computing
On the complexity of the disjunction property in intuitionistic and modal logics
ACM Transactions on Computational Logic (TOCL)
Admissible Rules of Modal Logics
Journal of Logic and Computation
Admissible Rules of Łukasiewicz Logic
Journal of Logic and Computation
Proof complexity of propositional default logic
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
Proof complexity is an interdisciplinary area of research utilizing techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures Traditionally, propositional proofs have been the main object of investigation in proof complexity Due their richer expressivity and numerous applications within computer science, also non-classical logics have been intensively studied from a proof complexity perspective in the last decade, and a number of impressive results have been obtained In this paper we give the first survey of this field concentrating on recent developments in proof complexity of non-classical logics.