On the weak pigeonhole principle

Fundamenta Mathematicae

Volumn 170, Issue 1-2, 2001, Pages 123-140

  Krajíček, Jan ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012527136     PISSN: 00162736     EISSN: None     Source Type: Journal    
DOI: 10.4064/fm170-1-8     Document Type: Article

References (24)

1. S. R. Buss, Bounded Arithmetic, Bibliopolis, Napoli, 1986.
2. S. R. Buss and T. Pitassi, Resolution and the weak pigeonhole principle, in: Computer Science Logic (Aarhus, 1997), Lecture Notes in Comput. Sci. 1414, Springer, 1998, 149-156.
3. S. R. Buss and G. Turán, Resolution proofs of generalized pigeonhole principles, Theoret. Comput. Sci. 62 (1988), 311-317.
4. M. Chiari and J. Krajíček, Witnessing functions in bounded arithmetic and search problems, J. Symbolic Logic 63 (1998), 1095-1115.
5. _, _, Lifting independence results in bounded arithmetic, Arch. Math. Logic 38 (1999), 123-138.
6. P. Erdos, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292-294.
7. A. Haken, The intractability of resolution, Theoret. Comput. Sci. 39 (1985), 297-308.
8. J. Krajíček, Lower bounds to the size of constant-depth propositional proofs, J. Symbolic Logic 59 (1994), 73-86.
9. _, On Frege and Extended Frege proof systems, in: Feasible Mathematics II, P. Clote and J. Remmel (eds.), Birkhäuser, 1995, 284-319.
10. _, Bounded Arithmetic, Propositional Logic, and Complexity Theory, Encyclopedia Math. Appl. 60, Cambridge Univ. Press, Cambridge, 1995.
11. _, Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic, J. Symbolic Logic 62 (1997), 457-486.
12. _, Uniform families of polynomial equations over a finite field and structures admitting an Euler characteristic of definable sets, Proc. London Math. Soc. 81 (2000), 257-284.
13. _, Tautologies from pseudo-random generators, Bull. Symbolic Logic 7 (2001), 197-212.
14. 2 and EF, in: Logic and Computational Complexity (Indianapolis, 1994), D. Leivant (ed.), Lecture Notes in Comput. Sci. 960, Springer, 1995, 200-220, revised version in: Inform. and Comput. 140 (1998), 82-94.
15. 2 and EF, in: Logic and Computational Complexity (Indianapolis, 1994), D. Leivant (ed.), Lecture Notes in Comput. Sci. 960, Springer, 1995, 200-220, revised version in: Inform. and Comput. 140 (1998), 82-94.
16. J. Krajíček, P. Pudlák and G. Takeuti, Bounded Arithmetic and the Polynomial Hierarchy, Ann. Pure Appl. Logic 52 (1991), 143-153.
17. B. Krishnamurthy and R. N. Moll, Examples of hard tautologies in the propositional calculus, in: 13th ACM Symposium on Theory of Computing, 1981, 28-37.
18. O. Kullmann, Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs, preprint available in ECCC, TR99-041, 1999.
19. A. Maciel, T. Pitassi, and A. Woods, A new proof of the weak pigeonhole principle, preprint, 2000.
20. J. Paris and A. J. Wilkie, Counting problems in bounded arithmetic, in: Methods in Mathematical Logic, Lecture Notes in Math. 1130, Springer, 1985, 317-340.
21. 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.
22. P. Pudlák, Ramsey's theorem in bounded arithmetic, in: Computer Science Logic, E. Boerger et al. (eds.), Lecture Notes in Comput. Sci. 553, Springer, 1991, 308-317.
23. S. Riis, Making infinite structures finite in models of second order bounded arithmetic, in: Arithmetic, Proof Theory and Computational Complexity, P. Clote and J. Krajíček (eds.), Oxford Univ. Press, 1973, 289-319.
24. D. R. Stinson, Cryptography: Theory and Practise, CRC Press, 1995.