Witnessing functions in bounded arithmetic and search problems

Journal of Symbolic Logic

Volumn 63, Issue 3, 1998, Pages 1095-1115

  Chiari, Mario ^a   Krajíček, Jan ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039492946     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586729     Document Type: Article

References (30)

1. 1-formulae on finite structures, Annals of Pure and Applied Logic, vol. 24 (1983), pp. 1-48.
2. S. R. BUSS, Bounded arithmetic, Bibliopolis, Naples, 1986.
3. _, The propositional pigeonhole principle has polynomial size Frege proofs, this JOURNAL, vol. 52 (1987), pp. 916-927.
4. _, Axiomatizations and conservation results for fragments of bounded arithmetic, Logic and computation, Contemporary Mathematics, no. 106, American Mathematical Society, Providence, 1990, pp. 57-84.
5. S. R. BUSS and J. KRAJÍČEK, An application of boolean complexity to separation problems in bounded arithmetic, Proceedings of the London Mathematical Society, vol. 69 (1994), no. 3, pp. 1-27.
6. 2, Arithmetic, proof theory and computational complexity (P. Clote and J. Krajíček, editors), Oxford University Press, Oxford, 1993, pp. 116-161.
7. M. CHIARI and J. KRAJÍČEK, Lifting independence results in bounded arithmetic, to appear, 1995.
8. S. A. COOK, The complexity of theorem proving procedures, Proceedings of the 3rd annual ACM symposium on theory of computing, ACM Press, 1971, pp. 151-158.
9. _, Feasibly constructive proofs and the propositional calculus, Proceedings of the 7th annual ACM symposium on theory of computing, ACM Press, 1975, pp. 83-97.
10. S. A. COOK and A. R. RECKHOW, The relative efficiency of propositional proof systems, this JOURNAL, vol. 44 (1979), no. 1, pp. 36-50.
11. M. FURST, J. B. SAXE, and M. SIPSER, Parity, circuits and the polynomial-time hierarchy, Mathematical Systems Theory, vol. 17 (1984), pp. 13-27.
12. J. HASTAD, Almost optimal lower bounds for small depth circuits, Randomness and computation (S. Micali, editor), Series in Advanced Comp. Res., no. 5, JAI Press, 1989, pp. 143-170.
13. J. KRAJÍČEK, No counter-example interpretation and interactive computation, Logic from computer science (Y. N. Moschovakis, editor), Mathematical Sciences Research Institute Publication, no. 21, Springer-Verlag, New York, 1992, Proceedings of a Workshop held November 13-17, 1989, in Berkeley, pp. 287-293.
14. _, Fragments of bounded arithmetic and bounded query classes, Transactions of the American Mathematical Society, vol. 338 (1993), no. 2, pp. 587-598.
15. _, Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, vol. 60, Cambridge University Press, Cambridge-New York-Melbourne, 1995.
16. J. KRAJÍČEK and P. PUDLÁK, Quantified propositional calculi and fragments of bounded arithmetic, Zeitschrift für Mathematikal Logik und Grundlagen der Mathematik, vol. 36 (1990), pp. 29-46.
17. J. KRAJÍČEK, P. PUDLÁK, and G. TAKEUTI, Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 143-153.
18. J. KRAJÍČEK, P. PUDLÁK, and A. WOODS, Exponential lower bound to the size of bounded depth Frege proofs ofthe pigeonhole principle, Random Structures and Algorithms, vol. 7 (1995), no. 1, pp. 15-39.
19. C. H. PAPADIMITRIOU, On graph-theoretic lemmata and complexity classes (extended abstract), Proceedings of the 31st IEEE symposium on foundations of computer science, vol. II, IEEE Computer Society, 1990, pp. 794-801.
20. C. H. PAPADIMITRIOU and M. YANNAKAKIS, Optimization, approximation and complexity classes, 20th annual ACM symposium on theory of computing, ACM Press, 1988, pp. 229-234.
21. R. PARIKH, Existence and feasibility in arithmetic, this JOURNAL, vol. 36 (1971), pp. 494-508.
22. J. PARIS and A. J. WILKIE, Counting problems in bounded arithmetic, Methods in mathematical logic, Lecture Notes in Mathematics, no. 1130, Springer-Verlag, 1985, pp. 317-340.
23. _, On the scheme of induction for bounded arithmetic formulas, Annals of Pure and Applied Logic, vol. 35 (1987), pp. 261-302.
24. J. B. PARIS, A. J. WILKIE, and A. R. WOODS, Provability of the pigeonhole principle and the existence of infinitely many primes, this JOURNAL, vol. 53 (1988), pp. 1235-1244.
25. T. PITASSI, P. BEAME, and R. IMPAGLIAZZO, Exponential lower bounds for the pigeonhole principle, Computational Complexity, vol. 3 (1993), pp. 97-140.
26. P. PUDLÁK, Some relations between subsystems of arithmetic and the complexity of computations, Logic from computer science (Y. N. Moschovakis, editor), Mathematical Sciences Research Institute Publication, no. 21, Springer-Verlag, 1992, Proceedings of a Workshop held November 13-17, 1989, in Berkeley, pp. 499-519.
27. S. RIIS, Making infinite structures finite in models of second order bounded arithmetic, Arithmetic, proof theory and computational complexity (P. Clote and J. Krajíček, editors), Oxford University Press, Oxford, 1993, pp. 289-319.
28. R. SMULLYAN, Theory of formal systems, Annals of Mathematical Studies, no. 47, Princeton University Press, Princeton, 1961.
29. G. TAKEUTI, RSUV isomorphism, Arithmetic, proof theory and computational complexity (P. Clote and J. Krajíček, editors), Oxford University Press, Oxford, 1993, pp. 364-386.
30. Y. YAO, Separating the polynomial-time hierarchy by oracles, Proceedings of the 26th annual IEEE symposium on foundations of computer science, 1985, pp. 1-10.