Advertisement

A Straightforward Proof of Köbler-Messner’s Result

  • Zenon Sadowski
Chapter
Part of the Synthese Library book series (SYLI, volume 320)

Abstract

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.

Keywords

Polynomial Time Turing Machine Proof System Boolean Formula Propositional Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balcâzar, J., Díaz, J., and Gabarró, J. (1995). Structural Complexity I. Springer-Verlag, Berlin, second edition.CrossRefGoogle Scholar
  2. Buss, S. (1996). Lectures on proof theory. Technical Report No. SOCS-Google Scholar
  3. School of Computer Science, McGill University, Montreal. Cook, S. (1971). The complexity of theorem proving procedures. Pro- Google Scholar
  4. ceedings of the 3rd ACM Symposium on Theory of Computing Google Scholar
  5. pp. 151–158. ACM Press, New York.Google Scholar
  6. Cook, S. and Reckhow, R. (1979). The relative efficiency of propositional proof systems. The Journal of Symbolic Logic, 44: 36–50.CrossRefGoogle Scholar
  7. 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
  8. Krajfcek, J. and PudlAk, P. (1989). Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic, 54: 1063–1079.CrossRefGoogle Scholar
  9. 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
  10. 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

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Zenon Sadowski
    • 1
  1. 1.University of BiałystokPoland

Personalised recommendations