Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic

Journal of Symbolic Logic

Volumn 62, Issue 2, 1997, Pages 457-486

  Krajíček, Jan ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031478484     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275541     Document Type: Article

References (46)

1. N. ALON and R. BOPPANA, The monotone circuit complexity of Boolean functions, Combinatorica, vol. 7 (1987), no. 1, pp. 1-22.
2. A. E. ANDREEV, On a method for obtaining lower bounds for the complexity of individual monotone functions, Doklady AN SSSR, vol. 282 (1985), no. 5, pp. 1033-1037, in Russian.
3. E. W. BETH, The foundations of mathematics, North-Holland, Amsterdam, 1959.
4. M. L. BONET, T. PITASSI, and R. RAZ, Lower bounds for cutting planes proofs with small coefficients, preprint, 1994.
5. S. R. BUSS, Bounded arithmetic, Bibliopolis, Naples, 1986.
6. S. R. BUSS and G. TURÁN, Resolution proofs of generalized pigeonhole principles, Theoretical Computer Science, vol. 62 (1988), pp. 311-317.
7. M. CHIARI and J. KRAJÍČEK, Witnessing functions in hounded arithmetic and search problems, submitted, 1994.
8. S. A. COOK, Feasibly constructive proofs and the propositional calculus, Proceedings of the 7th Annual ACM Symposium on Theory of Computing, ACM Press, 1975, pp. 83-97.
9. S. A. COOK and A. R. RECKHOW, The relative efficiency of propositional proof systems, this JOURNAL, vol. 44 (1979), no. 1, pp. 36-50.
10. W. COOK, C. R. COULLARD, and G. TURÁN, On the complexity of cutting plane proofs, Discrete Applied Mathematics, vol. 18 (1987), pp. 25-38.
11. W. CRAIG, Linear reasoning: A new form of the Herbrand-Gentzen theorem, this JOURNAL, vol. 22 (1957), no. 3, pp. 250-268.
12. _, Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory, this JOURNAL, vol. 22 (1957), no. 3, pp. 269-285.
13. H. FRIEDMAN, The complexity of explicit definitions, Advances in Mathematics, vol. 20 (1976), pp. 18-29.
14. Y. GUREVICH, Towards logic tailored for computational complexity, Proceedings of Logic Colloquium 1983 (Berlin), Springer Lecture Notes in Mathematics, no. 1104, Springer-Verlag, 1984, pp. 175-216.
15. A. HAKEN, The intractability of resolution, Theoretical Computer Science, vol. 39 (1985), pp. 297-308.
16. M. KARCHMER and A. WIGDERSON, Monotone circuits for connectivity require super-logarithmic depth, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM Press, 1988, pp. 539-550.
17. J. KRAJÍČEK, Exponentiation and second-order bounded arithmetic, Annals of Pure and Applied Logic, vol. 48 (1989), pp. 261-276.
18. _, No counter-example interpretation and interactive computation, Logic from Computer Science, Proceedings of a workshop held November 13-17, 1989, in Berkeley, Mathematical Sciences Research Institute Publication (Berlin) (Y. N. Moschovakis, editor), no. 21, Springer-Verlag, 1992, pp. 287-293.
19. _, Lower bounds to the size of constant-depth propositional proofs, this JOURNAL, vol. 59 (1994), no. 1, pp. 73-86.
20. _, Bounded arithmetic, propositional logic and complexity theory, Cambridge University Press, 1995.
21. _, On Frege and extended Frege proof systems, Feasible Mathematics II (P. Clote and J. Remmel, editors), Birkhäuser, 1995, pp. 284-319.
22. J. KRAJÍČEK and P. PUDLÁK, Propositional proof systems, the consistency of first order theories and the complexity of computations, this JOURNAL, vol. 54 (1989), no. 3, pp. 1063-1079.
23. _, Propositional provability in models of weak arithmetic, Computer Science Logic (E. Boerger, H. Kleine-Bunning, and M. M. Richter, editors), Lecture Notes in Computer Science, no. 440, Springer-Verlag, Berlin, 1990, Kaiserlautern, October 1989, pp. 193-210.
24. _, Quantified propositional calculi and fragments of bounded arithmetic, Zeitschrift für Mathematikal Logik und Grundlagen der Mathematik, vol. 36 (1990), pp. 29-46.
25. 2 and EF, Proceedings of the meeting Logic and Computational Complexity (D. Leivant, editor), 1995, Indianapolis, October 1994, to appear.
26. 1-polynomial induction, Feasible mathematics (S. R. Buss and P. J. Scott, editors), Birkhäuser, 1990, pp. 259-280.
27. _, On induction-free provability, Annals of Mathematics and Artificial Intelligence, vol. 6 (1992), pp. 107-126.
28. G. KREISEL, Technical report nb. 3, Applied Mathematics and Statistics Labs, Stanford University, unpublished, 1961.
29. M. LUBY, Pseudo-randomness and applications, International Computer Science Institute, Berkeley, lecture notes, 1993.
30. D. MUNDICI, A lower bound for the complexity of Craig's interpolants in sentential logic, Archiv für Mathematikal Logik, vol. 23 ( 1983), pp. 27-36.
31. _, NP and Craig's interpolation theorem, Proceedings of Logic Colloquium 1982 North-Holland, 1984, pp. 345-358.
32. _, Tautologies with a unique Craig interpolant, uniform vs. non-uniform complexity, Annals of Pure and Applied Logic, vol. 27 (1984), pp. 265-273.
33. A. PAPADIMITRIOU, Computational complexity, Addison-Wesley, 1994.
34. R. PARIKH, Existence and feasibility in arithmetic, this JOURNAL, vol. 36 (1971), pp. 494-508.
35. J. PARIS and A. J. WILKIE, Counting problems in bounded arithmetic, Methods in Mathematical Logic, Springer Lecture Notes in Mathematics, no. 1130, Springer-Verlag, Berlin, 1985, pp. 317-340.
36. _, On the scheme of induction for bounded arithmetic formulas, Annals of Pure and Applied Logic, vol. 35 (1987), pp. 261-302.
37. 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.
38. V. R. PRATT, Every prime has a succinct certificate, SIAM Journal of Computing, vol. 4 (1975), pp. 214-220.
39. A. A. RAZBOROV, Lower bounds on the monotone complexitv of some Boolean functions, Soviet Mathem. Doklady, vol. 31 (1985), pp. 354-357.
40. _, An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic, Arithmetic, Proof Theory and Computational Complexity (P. Clote and J. Krajíček, editors), Oxford University Press, 1993, pp. 247-277.
41. _, On provably disjoint NP-pairs, preprint, 1994.
42. _, Bounded arithmetic and lower bounds in Boolean complexity, Feasible mathematics II (P. Clote and J. Remmel, editors), Birkhäuser, 1995, pp. 344-386.
43. _, Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic, Izvestiya of the R. A. N., vol. 59 (1995), no. 1, pp. 201-224.
44. A. A. RAZBOROV and S. RUDICH, Natural proofs, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM Press, 1994, pp. 204-213.
45. G. TAKEUTI, Proof theory, North-Holland, 1975.
46. _, RSUV isomorphism, Arithmetic, Proof Theory and Computational Complexity (P. Clote and J. Krajíček, editors), Oxford University Press, 1993, pp. 364-386.