A Straightforward Proof of Köbler-Messner’s Result
Proof systems for classical propositional logic, previously studied only by logicians, now are the subject of intensive research in computer science. There is a special branch of Theoretical Computer Science, named as Proof Complexity Theory, which is concerned with proving lower bounds on the length of proofs in different propositional proof systems and with comparing their efficiency. The study on the complexity of propositional proof systems is motivated by the open question NP=co-NP? This question, closely related to the famous P=NP? problem, can be stated as a problem on the length of proofs in propositional calculus.
KeywordsPolynomial Time Turing Machine Proof System Boolean Formula Propositional Formula
Unable to display preview. Download preview PDF.
- Buss, S. (1996). Lectures on proof theory. Technical Report No. SOCS-Google Scholar
- School of Computer Science, McGill University, Montreal. Cook, S. (1971). The complexity of theorem proving procedures. Pro- Google Scholar
- ceedings of the 3rd ACM Symposium on Theory of Computing Google Scholar
- pp. 151–158. ACM Press, New York.Google Scholar
- Köhler, J. and Messner, J. (1998). Complete problems for promise classes by optimal proof systems for test sets. Proceedings of the 13th Annual IEEE Conference on Computational Complexity, pp. 132–140. IEEE Computer Society Press, New York.Google Scholar
- Messner, J. and Torân, J. (1998). Optimal proof systems for propositional logic and complete sets. Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 1373:477–487. Springer-Verlag, Berlin.Google Scholar
- Sadowski, Z. (1997). On an optimal quantified propositional proof system and a complete language for NP n co-NP. Proceedings of the 11th International Symposium Fundamentals of Computational Theory, Lecture Notes in Computer Science, 1279:423–428. Springer-Verlag, Berlin.Google Scholar