A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The polynomial hierarchy and fragments of bounded arithmetic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Reexamining intractability of tableau methods
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Dissolution: making paths vanish
Journal of the ACM (JACM)
The complexity of analytic tableaux
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
On the Structure of the Simulation Order of Proof Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Examples of hard tautologies in the propositional calculus
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the validity and complexity of bounded resolution
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Some connections between mathematical logic and complexity theory
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Optimal proof systems imply complete sets for promise classes
Information and Computation
Geometry of deduction via graphs of proofs
Logic for concurrency and synchronisation
Making knowledge explicit: how hard it is
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
Logical omniscience as a computational complexity problem
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
On the polynomial transparency of resolution
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Artificial Intelligence
Atomic cut introduction by resolution: proof structuring and compression
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Logical omniscience via proof complexity
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On sequent systems and resolution for QBFs
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
One of the most important open questions in the field of computational complexity is the question of whether there is a polynomial time decision procedure for the classical propositional calculus. The purpose of the present paper is to study a question related to the complexity of decision procedures for the propositional calculus; namely, the complexity of proof systems for the propositional calculus. The fundamental issue here is whether there exists any proof system, and a polynomial p(n) such that every valid formula has a proof of length not exceeding p(n), where n is the length of the formula. Theorem 1 below helps establish the importance of this question. For the purposes of this theorem, we give the following definitions.