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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1279, Issue , 1997, Pages 423-428

  Sadowski, Zenon ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC;

PROPOSITIONAL PROOF SYSTEMS;

COMPUTATION THEORY;

EID: 84958766215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036203     Document Type: Conference Paper

References (12)

1. Balcazar J.L., Díaz J. and Gabarró J. (1995) Structural complexity I, Springer.
2. Cook S.A. (1971) The complexity of theorem proving procedures, in: Proc. 3rd ACM Symposium on Theory of Computing, pp. 151-158.
3. Cook S.A. and Reckhow R.A. (1979) The relative efficiency of propositional proof systems, J. Symbolic Logic, 44, pp. 36-50.
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, pp. 250-259, Springer.
5. Hopcroft J. and Ullman J. (1979) Introduction to Automata Theory, Languages and Computation, Addison-Wesley.
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.
7. Krajiček J. (1995) Bounded Arithmetic, Propositional Logic, and Complexity Theory Cambridge University Press.
8. Krajiček J. and Pudlák P. (1990) Quantified propositional calculi and fragments of bounded arithmetic, Zeitschr. f. math. Logik und Grundlagen d. Math. 36, pp. 29-46.
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.
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.
11. Stockmeyer L. (1977) The polynomial-time hierarchy, Theor. Comp. Sci. 3, pp. 1-22.
12. Urquhart A. (1995) The complexity of propositional proofs, Bull. Symb. Log. 1, pp. 425-467.