Resolution proofs of generalized pigeonhole principles
- 31 December 1988
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 62 (3), 311-317
- https://doi.org/10.1016/0304-3975(88)90072-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Provability of the pigeonhole principle and the existence of infinitely many primesThe Journal of Symbolic Logic, 1988
- Polynomial size proofs of the propositional pigeonhole principleThe Journal of Symbolic Logic, 1987
- On the complexity of cutting-plane proofsDiscrete Applied Mathematics, 1987
- Hard examples for resolutionJournal of the ACM, 1987
- The intractability of resolutionTheoretical Computer Science, 1985
- Counting problems in bounded arithmeticLecture Notes in Mathematics, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979