Proofs as games

American Mathematical Monthly

Volumn 107, Issue 6, 2000, Pages 541-550

  Pudlák, Pavel ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034347425     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2589349     Document Type: Article

References (7)

1. S. R. Buss and Gy. Turán, Resolution proofs of generalized pigeonhole principles, Theoret. Comput. Sci. 62 (1988) 311-317.
2. A. Haken, The intractability of resolution, Theoret. Comput. Sci. 39 (1985) 297-308.
3. J. Krajíček, Bounded Arithmetic, Proportional Logic, and Complexity Theory, Cambridge University Press, 1995.
4. P. Pudlák, The lengths of proofs, in Handbook of Proof Theory, S. A. Buss editor, North Holland 1998, pp. 547-637.
5. P. Pudlák and S. R. Buss, How to lie without being (easily) convicted and the lengths of proofs in propositional calculus, in Computer Science Logic '94, L. Pacholski and J. Tiuryn, eds., Springer-Verlag LNCS 933, 1995, pp. 151-162.
6. J. A. Robinson, A machine-oriented logic based on the resolution principle, J. ACM, 12 (1965) 23-41.
7. A. Razborov, A. Wigderson and A. Yao, Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus, Proc. Annual ACM Symp. on Theory of Computation, 1997, pp. 739-748.