On an optimal propositional proof system and the structure of easy subsets of TAUT

Theoretical Computer Science

Volumn 288, Issue 1, 2002, Pages 181-193

  Sadowski, Zenon ^a  

^a UNIVERSITY OF BIALYSTOK   (Poland)

Author keywords

Classical propositional logic; Complexity classes; Complexity of computation; Complexity of proofs

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

PROPOSITIONAL PROOF SYSTEMS;

RECURSIVE FUNCTIONS;

EID: 0037048581     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00155-4     Document Type: Conference Paper

References (15)

1. J. Balcazar, J. Díaz, J. Gabarró Structural Complexity I. 1995;Springer, Berlin.
2. S. Buss, Lectures on proof theory. Tech. Report No. SOCS-96.1, McGill University, 1966.
3. S. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symp. on Theory of Computing, 1971, pp. 151-158.
4. S. Cook, R. Reckhow, The relative efficiency of propositional proof systems. J. Symbolic Logic. 44:1979;36-50.
5. J. Hartmanis, L. Hemachandra, Complexity classes without machines: on complete languages for UP. Theoret. Comput. Sci. 58:1988;129-142.
6. J. Hartmanis, N. Immerman, On complete problems for NP ∩ co-NP, in: Proc. 12th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 194, Springer, Berlin, 1985, pp. 250-259.
7. W. Kowalczyk, 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, vol. 176, Springer, Berlin, 1988, pp. 364-369.
8. J. Köbler, J. Messner, Complete problems for promise classes by optimal proof systems for test sets, in: Proc. 13th Ann. IEEE Conf. on Computational Complexity, IEEE Computer Soc. Press, Silver Spring, MD, 1998, pp. 132-140.
9. J. Krajíček, P. Pudlák, Propositional proof systems, the consistency of first order theories and the complexity of computations. J. Symbolic Logic. 54:1989;1063-1079.
10. L. Landweber, R. Lipton, E. Robertson, On the structure of sets in NP and other complexity classes. Theoret. Comput. Sci. 15:1981;181-200.
11. J. Messner, On optimal algoritms and optimal proof systems, in: Proc. 16th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1563, Springer, Berlin, 1999.
12. J. Messner, J. Torán, Optimal proof systems for propositional logic and complete sets, in: Proc. 15th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, pp. 477-487.
13. C. Papadimitriou, Computational Complexity. 1994;Addison-Wesley, Reading, MA.
14. H. Rice, Classes of recursively enumerable sets and their decision problems. Trans. Amer. Math. Soc. 74:1953;358-366.
15. Z. Sadowski, On an optimal quantified propositional proof system and a complete language for NP ∩ co-NP, in: Proc. 11th Internat. Symp. on Fundamentals of Computing Theory, Lecture Notes in Computer Science, vol. 1279, Springer, Berlin, 1997, pp. 423-428.