Skip to main content
SpringerLink
Log in

On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Included in the following conference series:

Abstract

In this paper we prove that if there exists an optimal quantified propositional proof system then there exists a complete language for NP ∩ co-NP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balcazar J.L., Díaz J. and Gabarró J. (1995) Structural complexity I, Springer.

    Google Scholar 

  2. Cook S.A. (1971) The complexity of theorem proving procedures, in: Proc. 3rd ACM Symposium on Theory of Computing, pp. 151–158.

    Google Scholar 

  3. Cook S.A. and Reckhow R.A. (1979) The relative efficiency of propositional proof systems, J. Symbolic Logic, 44, pp. 36–50.

    Google Scholar 

  4. Hartmanis J., Immerman N. (1985) On complete problems for NP ∩ co-NP, in: Proc. 12th Internat. Coll. on Automata, Languages and Programming, LNCS 194, 250–259, Springer.

    Google Scholar 

  5. Hopcroft J. and Ullman J. (1979) Introduction to Automata Theory, Languages and Computation, Addison-Wesley.

    Google Scholar 

  6. Kowalczyk W. (1984) Some connections between presentability of complexity classes and the power of formal systems of reasoning, in: Proc. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 176, pp. 364–369, Springer.

    Google Scholar 

  7. Krajiček J. (1995) Bounded Arithmetic, Propositional Logic, and Complexity Theory Cambridge University Press.

    Google Scholar 

  8. Krajiček J. and Pudlák P. (1990) Quantified propositional calculi and fragments of bounded arithmetic, Zeitschr. f. math. Logik and Grundlagen d. Math. 36, pp.29–46.

    Google Scholar 

  9. Krajiček J. and Pudlák P. (1989) Propositional proof systems, the consistency of first order theories and the complexity of computations, J. Symbolic Logic, 54, pp. 1063–1079.

    Google Scholar 

  10. Sipser M. (1982) On relativizations and the existence of complete sets, in: Proc. Internat. Coll. on Automata, Languages and Programming, LNCS 140, pp. 523–531, Springer.

    Google Scholar 

  11. Stockmeyer L. (1977) The polynomial-time hierarchy, Theor. Comp. Sci. 3, pp. 1–22.

    Article  Google Scholar 

  12. Urquhart A. (1995) The complexity of propositional proofs, Bull. Symb. Log. 1, pp. 425–467.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, Bialystok Division, Bialystok, 15-257, ul. Akademicka 2, Poland

    Zenon Sadowski

Authors
  1. Zenon Sadowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sadowski, Z. (1997). On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036203

Download citation

  • DOI: https://doi.org/10.1007/BFb0036203

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation