A new proof of the weak pigeonhole principle

Journal of Computer and System Sciences

Volumn 64, Issue 4, 2002, Pages 843-872

  Maciel, Alexis ^a   Pitassi, Toniann ^b,c   Woods, Alan R ^d  

^a CLARKSON UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF ARIZONA   (United States)

^d UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPHIC METHODS; INTERPOLATION; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUERY LANGUAGES;

PIGEONHOLE PRINCIPLE; POLYLOGS; SMOOTH INTEGERS; SPANNING TREES;

THEOREM PROVING;

EID: 1642617810     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1830     Document Type: Conference Paper

References (25)

1. A. Atserias, Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms, manuscript, 2001.
2. P. Beame and S. Riis, More on the relative strength of counting principles, in "Proof Complexity and Feasible Arithmetics" (P. W. Beame and S. R. Buss, Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 39, pp. 13-35, Amer. Math. Soc., Providence, RI, 1998.
3. A. Berarducci and B. Intrigua, Combinatorial principles in elementary number theory, Ann. Pure Appl. Logic 55 (1991), 35-50.
4. S. R. Buss, "Bounded Arithmetic," Studies in Proof Theory, Vol. 3, Bibliopolis, Napoli, 1986.
5. S. R. Buss, Polynomial size proofs of the propositional pigeonhole principle, J. Symbolic Logic 52 (1987), 916-927.
6. S. R. Buss, Axiomatizations and conservation results for fragments of bounded arithmetic, in "Logic and Computation: Proceedings of a Workshop held at Carnegie Mellon University, June 30-July 2, 1987" (W. Sieg, Ed.), Contemporary Mathematics, Vol. 106, pp. 57-84, Amer. Math. Soc., Providence, RI, 1990.
7. S. R. Buss and T. Pitassi, Resolution and the weak pigeonhole principle, Comput. Sci. Logic (1997), 149-156.
8. S. R. Buss and G. Turán, Resolution proofs of generalized pigeonhole principles, Theoret. Comput. Sci. 62(1988), 311-317.
9. P. Hájek and P. Pudlák, "Metamathematics of First-Order Arithmetic," Perspectives in Mathematical Logic Series, Springer-Verlag, Berlin, 1993.
10. J. Krajíček, Lower bounds to the size of constant-depth propositional proofs, J. Symbolic Logic 59 (1994), 73-86.
11. J. Krajíček, "Bounded Arithmetic, Propositional Logic and Complexity Theory," Encyclopedia of Mathematics and Its Applications, Vol. 60, Cambridge Univ. Press, Cambridge, UK, 1995.
12. J. Krajíček, On the weak pigeonhole principle, manuscript, Aug. 1999.
13. J. Krajíček, Seminar notes (15.11.99), typeset page, Nov. 1999.
14. J. Krajíček, P. Pudlák, and A. Woods, Exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle, Random Structures Algorithms 1 (1995), 15-39.
15. A. J. Macintyre, The strength of weak systems, in "Logic, Philosophy of Science and Epistemology: Proceedings 11th International Wittgenstein Symposium, Kirchberg/Wechsel, Austria 1986," pp. 43-59, Hölder-Pichler-Tempsky, Vienna, 1987.
16. J. B. Paris and A. J. Wilkie, Counting problems in bounded arithmetic, in "Methods in Mathematical Logic: Proceedings of the 6th Latin American Symposium on Mathematical Logic 1983," Lectures Notes in Mathematics, Vol. 1130, pp. 317-340, 1985.
17. J. B. Paris, A. J. Wilkie, and A. R. Woods, Provability of the pigeonhole principle and the existence of infinitely many primes, J. Symbolic Logic 53 (1988), 1235-1244.
18. T. Pitassi, P. Beame, and R. Impagliazzo, Exponential lower bounds for the pigeonhole principle, Comput. Complexity (1993), 97-140.
19. T. Pitassi and R. Raz, Lower bounds for regular resolutions proofs of the weak pigeonhole principle, in "Proceedings of the 33rd ACM Symposium on Theory of Computing," 2001, in press.
20. R. Raz, Lower bounds for resolution proofs of the weak pigeonhole principle, in "Electronic Colloquium on Computational Complexity," Report 21, 2001.
21. A. A. Rasborov, Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic, Izv. Ross. Akad. Nauk 59 (1995), 201-224.
22. A. A. Razborov and S. Rudich, Natural proofs, J. Comput. System Sci. 55 (1997), 24-35.
23. A. A. Razborov, A. Wigderson, and A. C. Yao, Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus, in "Proceedings of the 29th ACM Symposium on Theory of Computing," pp. 739-748, 1997.
24. S. Riis, A complexity gap for tree-resolution, manuscript, Sept. 1999.
25. A. J. Wilkie, Some results and problems on weak systems of arithmetic, in "Logic Colloquium '77" (A. Macintyre, L. Pacholski, and J. Paris, Eds.), pp. 237-248, North-Holland, Amsterdam, 1978.