Chapter VIII The lengths of proofs

Studies in Logic and the Foundations of Mathematics

Volumn 137, Issue C, 1998, Pages 547-637

  Pudlák, Pavel ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956702361     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(98)80023-2     Document Type: Chapter

References (133)

1. Ajtai M. Parity and the pigeonhole principle. In: Buss S.R., and Scott P.J. (Eds). Feasible Mathematics: A Mathematical Sciences Institute Workshop held. Ithaca, New York, June 1989 (1990), Birkhäuser, Boston 1-24
2. Ajtai M. The complexity of the pigeonhole principle. Combinatorica 14 (1994) 417-433
3. Extended abstract, Proc. 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 346-355
4. Ajtai M. The independence of the modulo p counting principles. Proceedings of the 26th Annual ACM Symposium on the Theory of Computing. Association for Computing Machinery, New York (1994) 402-411
5. Ajtai M. On the existence of modulo p cardinality functions. In: Clote P., and Remmel J.B. (Eds). Feasible Mathematics II (1995), Birkhäauser, Boston 1-14
6. Alon N., and Boppana R. The monotone circuit complexity of boolean functions. Combinatorica 7 (1987) 1-22
7. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and hardness of approximation problems. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Piscataway, New Jersey (1992) 14-23
8. Baaz M., and Leitsch A. Complexity of resolution proofs and function introduction. Annals of Pure and Applied Logic 20 (1992) 181-215
9. Baaz M., and Leitsch A. On Skolemization and proof complexity. Fundamenta Mathematicae 20 (1994)
10. 1 . In: Clote P., and Krajíček J. (Eds). Arithmetic Proof Theory and Computational Complexity (1993), Oxford University Press 30-39
11. Baaz M., and Zach R. Generalizing theorems in real closed fields. Annal of Pure and Applied Logic 75 (1995) 2-23
12. Beame P., Impagliazzo R., Krajíček J., Pitassi T., and Pudlák P. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proceedings of the London Mathematical Society 73 (1996) 1-26
13. Beame P., Impagliazzo R., Krajíček J., Pitassi T., Pudlák P., and Woods A. Exponential lower bounds for the pigeonhole principle. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. Association for Computing Machinery, New York (1992) 200-221
14. Beame P., and Pitassi T. Exponential separation between the matching principles and the pigeonhole principle. Annals of Pure and Applied Logic 80 (1996) 195-228
15. Bellantoni S., Pitassi T., and Urquhart A. Approximation and small-depth Frege proofs. SIAM Journal on Computing 21 (1992) 1161-1179
16. Beth E.W. The Foundations of Mathematics (1959), North-Holland, Amsterdam
17. Bonet M.L., and Buss S.R. The deduction rule and linear and near-linear proof simulations. Journal of Symbolic Logic 58 (1993) 688-709
18. An earlier version appeared. Bonet M.L., Pitassi T., and Raz R. Lower bounds for cutting planes proofs with small coefficients. Journal of Symbolic Logic 62 (1997) 708-728
19. Proc. Twenty-Seventh Annual ACM Symposium on the Theory of Computing (1995) 575-584
20. 0 -Frege proofs. Proceedings of the 38th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Piscataway, New Jersey (1997) 254-263
21. Buss S.R. Bounded Arithmetic. Revision of 1985 Princeton University Ph.D. thesis (1986), Bibliopolis, Napoli
22. Buss S.R. Polynomial size proofs of the propositional pigeonhole principle. Journal of Symbolic Logic 52 (1987) 916-927
23. Buss S.R. Propositional consistency proofs. Annals of Pure and Applied Logic 52 (1991) 3-29
24. Buss S.R. The undecidability of k-provability. Annals of Pure and Applied Logic 53 (1991) 75-102
25. Buss S.R. On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics. Journal of Symbolic Logic 59 (1994) 737-756
26. Buss S.R. On Gödel's theorems on lengths of proofs II: Lower bounds for recognizing k-symbol provability. In: Clote P., and Remmel J.B. (Eds). Feasible Mathematics II (1995), Birkhäauser, Boston 57-90
27. Buss S.R. Some remarks on lengths of propositional proofs. Archive for Mathematical Logic 34 (1995) 377-394
28. Buss S.R., and Clote P. Cutting planes, connectivity and threshold logic. Archive for Mathematical Logic 35 (1996) 33-62
29. Buss S.R., Impagliazzo R., Krajíček J., Pudlák P., Razborov A.A., and Sgall J. Proof complexity in algebraic systems and constant depth Frege systems with modular counting. Computational Complexity 6 (1996/1997) 256-298
30. Typeset manuscript, to appear in CSL'97. Buss S.R., and Pitassi T. Resolution and the Weak Pigeonhole Principle (1997)
31. Buss S.R., and Turán Gy. Resolution proofs of generalized pigeonhole principles. Theoretical Computer Science 62 (1988) 311-317
32. Chang C.-L., and Lee R.C.-T. Symbolic Logic and Mechanical Theorem Proving (1973), Academic Press, New York
33. Clegg M., Edmonds J., and Impagliazzo R. Using the Groebner basis algorithm to find proofs of unsatisfiablility. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing. Association for Computing Machinery, New York (1996) 174-183
34. Clote P. ALOGTIME and a conjecture of S. A. Cook. Annals of Mathematics and Artificial Inteligence 6 (1992) 57-106
35. Clote P., and Krajíček J. Arithmetic, Proof Theory and Computational Complexity (1993), Oxford University Press
36. Compton K.J., and Henson C.W. A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic 48 (1990) 1-79
37. Cook S.A. Feasibly constructive proofs and the propositional calculus. Proceedings of the Seventh Annual ACM Symposium on the Theory of Computing. Association for Computing Machinery, New York (1975) 83-97
38. Cook S.A., and Reckhow R.A. The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44 (1979) 36-50
39. Cook W., Coullard C.R., and Turán Gy. On the complexity of cutting plane proofs. Discrete Applied Mathematics 18 (1987) 25-38
40. Craig W. Linear reasoning. A new form of the Herbrand-Gentzen theorem. Journal of Symbolic Logic 22 (1957) 250-268
41. Craig W. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. Journal of Symbolic Logic 22 (1957) 269-285
42. Dowd M. Propositional Representation of Arithmetic Proofs. PhD thesis (1979), University of Toronto
43. Typewritten manuscript. Dowd M. Model-Theoretic Aspects of P∈NP (1985)
44. Dragalin A.G. Correctness of inconsistent theories with notions of feasibility. In: Skowron A. (Ed). Computation Theory, Fifth Symposium Proceedings. vol. 108 of Lecture Notes in Computer Science #208 (1985), Springer-Verlag, Berlin 58-79
45. Eder E. Relative Complexities of First Order Calculi (1992), Verlag Vieweg
46. Ehrenfeucht A., and Mycielski J. Abbreviating proofs by adding new axioms. Bulletin of the American Mathematical Society 77 (1971) 366-367
47. Farmer W.M. Length of Proofs and Unification Theory. PhD thesis (1984), University of Wisconsin, Madison
48. Farmer W.M. A unification algorithm for second order monadic terms. Annals of Pure and Applied Logic 39 (1988) 131-174
49. Ferrante J., and Rackoff C.W. The Computational Complexity of Logical Theories. Lecture Notes in Mathematics #718 (1979), Springer-Verlag, Berlin
50. Friedman H.M. One hundred and two problems in mathematical logic. Journal of Symbolic Logic 40 (1975) 113-129
51. unpublished. Friedman H.M. On the consistency, completeness, and correctness problems (1979), Ohio State University
52. Gavrilenko Yu.V. Monotone theories of feasible numbers. Doklady Akademii Nauk SSSR 276 (1984) 18-22
53. Gentzen G. Untersuchungen über das Logische Schliessen. Mathematische Zeitschrift 39 (1935) 176-210
54. Gentzen G. Untersuchugen über das Logische, Schliessen. Mathematische Zeitschrift 39 (1935) 405-431
55. Girard J.-Y. Proofs and Types (1989), Cambridge University Press
56. English translation. Gödel K. Über die Länge von Beweisen. Ergebnisse eines Mathematischen Kolloquiums. Kurt Gödel: Collected Works Volume 1 (1936-1986), Oxford University Press 396-399
57. Gödel K. A letter to von Neumann, March 20, 1956. In: Clote P., and Krajíček J. (Eds). Arithmetic Proof Theory and Computational Complexity (1993), Oxford University Press vii-ix
58. Goerdt A. Cutting plane versus Frege proof systems. In: Börger E., et al. (Ed). Computer Science Logic: 4th workshop, CSL '90. Lecture Notes in Computer Science #533 (1991), Springer-Verlag, Berlin 174-194
59. PWN-Polish Scientific Publishers, Warsaw. Translation of Zarys logiki matematicznej, Państwowe Wyadwnictwo Naukowe, 1969. Grzegorczyk A. An Outline of Mathematical Logic (1974), D. Reidel Publishing Co., Dordrecht-Boston, Mass.
60. Hájek P., Montagna F., and Pudlák P. Abbreviating proofs using metamathematical rules. In: Clote P., and Krajíček J. (Eds). Arithmetic Proof Theory and Computational Complexity (1993), Oxford University Press 197-221
61. Hájek P., and Pudlák P. Metamathematics of First-order Arithmetic. Perspectives in Mathematical Logic (1993), Springer-Verlag, Berlin
62. Hajós G. Über eine Konstruktion nicht n-färberer Graphen. Wiss. Zeitschr. M. Luther Univ. Halle-Wittenberg A10 (1961) 116-117
63. Haken A. The intractability of resolution. Theoretical Computer Science 39 (1985) 297-308
64. A. Haken and S. A. Cook [n.d.] An Exponential Lower Bound for the Size of Monotone Real Circuits. To appear in J. of Computer and System Science.
65. Hstad J. Computation Limits of Small Depth Circuits (1986), MIT Press
66. Hilbert D., and Ackermann W. Grundzüge der theoretischen Logik (1928), Springer-Verlag, Berlin
67. Hilbert D., and Bernays P. Grundlagen der Mathematik I (1934), Springer-Verlag, Berlin
68. Hilbert D., and Bernays P. Grundlagen der Mathematik II (1939), Springer-Verlag, Berlin
69. Ignjatović A. Fragments of First and Second Order Arithmetic and Length of Proofs. PhD thesis (1990), University of California, Berkeley
70. Impagliazzo R., Pudlák P., and Sgall J. Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm. Tech. Rep. TR97-042 (1997), Electronic Colloquium on Computational Complexity (ECCC)
71. Johannsen J. Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes. Tech. Rep. TR97-032, Electronic Colloquium on Computational Complexity (1997). http://www.eccc.uni.trier.de/eccc/
72. J. Krajíček [n.d.] Discretely Ordered Modules as a First-Order Extension of the Cutting Planes Proof System. To appear in the J. of Symbolic Logic.
73. Krajíček J. On the number of steps in proofs. Annals of Pure and Applied Logic 41 (1989) 153-178
74. Krajíček J. Speed-up for propositional Frege systems via generalizations of proofs. Commentationes Mathematicae Universitatis Carolinae 30 (1989) 137-140
75. Krajíček J. Lower bounds to the size of constant-depth propositional proofs. Journal of Symbolic Logic 59 (1994) 73-86
76. Krajíček J. On Frege and extended Frege proof systems. In: Krajíček J., and Remmel J.B. (Eds). Feasible Mathematics II (1994), Birkhäuser, Boston 284-319
77. Krajíček J. Bounded Arithmetic, Propositional Logic and Complexity Theory (1995), Cambridge University Press
78. Krajíček J. Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic. Journal of Symbolic Logic 62 (1997) 457-486
79. Typeset manuscript. Krajíček J. On the Degree of Ideal Membership Proofs from Uniform Families of Polynomials over a Finite Field (1997)
80. Krajíček J., and Pudlák P. The number of proof lines and the size of proofs in first-order logic. Archive for Mathematical Logic 27 (1988) 69-84
81. Krajíček J., and Pudlák P. Propositional proof systems, the consistency of first-order theories and the complexity of computations. Journal of Symbolic Logic 54 (1989) 1063-1079
82. Krajíček J., and Pudlák P. Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36 (1990) 29-46
83. 1 and EF. Information and Computation 140 (1998) 82-94
84. Krajíček J., Pudlák P., and Woods A. An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms 7 (1995) 15-39
85. 1 -polynomial induction. In: Buss S.R., and Scott P.J. (Eds). Feasible Mathematics (1990), Birkhäuser, Boston 259-280
86. Kreisel G. Mathematical logic: What has it done for the philosophy of mathematics. In: Shoenemann R. (Ed). Bertrand Russell: Philosopher of the Century, Essays in his Honour (1967), George Allen and Unwin 201-272
87. Kreisel G. Logical aspects of computation: Contributions and distractions. Logic and Computer Science (1990), Academic Press, New York 205-278
88. Luckhardt H. Herbrand-Analysen zweier Beweise des Satzes von Roth: polynomiale Anzahlschranken. Journal of Symbolic Logic 54 (1989) 234-263
89. Miyatake T. On the length of proofs in formal systems. Tsukuba Journal of Mathematics 4 (1980) 115-125
90. Mundici D. NP and Craig's interpolation theorem. In: Lolli G., Longo G., and Marcja A. (Eds). Logic Colloquium '82 (1984), North-Holland, Amsterdam 345-358
91. Nelson E. Predicative Arithmetic (1986), Princeton University Press
92. Original Russian version in. Orevkov V.P. Lower bounds on the increase in complexity of deductions in cut elimination. Journal of Soviet Mathematics (1982) 20
93. Orevkov V.P. Lower bounds on the increase in complexity of deductions in cut elimination. Zap. Nauchn. Sem. L.O.M.I. 88 (1982) 137-162 1979
94. Original Russian version in. Orevkov V.P. Upper bound on the lengthening of proofs by cut elimination. Journal of Soviet Mathematics 34 (1986) 1810-1819
95. Orevkov V.P. Upper bound on the lengthening of proofs by cut elimination. Zap. Nauchn. Sem. L.O.M.I. 137 (1986) 87-98 1984
96. Original Russian version in. Orevkov V.P. Lower bounds on the lengths of derivations in arithmetic in terms of the complexity of terms involved in the derivations. Soviet Mathematics Doklady 35 (1987) 579-582
97. Orevkov V.P. Lower bounds on the lengths of derivations in arithmetic in terms of the complexity of terms involved in the derivations. Dokl. Akad. Nauk. 294/4 (1987)
98. Original Russian version in. Orevkov V.P. Reconstruction of a proof from its scheme. Soviet Mathematics Doklady 35 (1987) 326-329
99. Orevkov V.P. Reconstruction of a proof from its scheme. Dokl. Akad. Nauk. 293 (1987) 313-316
100. Orevkov V.P. Correctness of short proofs in theory with notions of feasibility. In: Martin-Löf P., and Mints G.E. (Eds). COLOG-88: International Conference on Computer Logic, Tallinn, USSR, Dec. 1988, Proceedings. Lecture Notes in Computer Science #417 (1990), Springer-Verlag, Berlin 242-245
101. Orevkov V.P. Complexity of Proofs and Their Transformations in Axiomatic theories. vol. 128 of Translations of Mathematical Monographs (1993), American Mathematical Society, Providence, Rhode Island
102. Parikh R. Existence and feasibility in arithmetic. Journal of Symbolic Logic 36 (1971) 494-508
103. Parikh R. Some results on the lengths of proofs. Transactions of the American Mathematical Society 177 (1973) 29-36
104. Paris J.B., and Wilkie A.J. Counting problems in bounded arithmetic. In: Di Prisco C.A. (Ed). Methods in Mathematical Logic, Proceedings of the 6-th Latin American Symposium. Caracas, Venezuella. Lecture Notes in Mathematics #1130 (1985), Springer-Verlag, Berlin 317-340
105. Pitassi T., Beame P., and Impagliazzo R. Exponential lower bounds for the pigeonhole principle. Computational Complexity 3 (1993) 97-140
106. Pitassi T., and Urquhart A. The complexity of the HajósnameindexHajós, G. calculus. Proceedings of the 33th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Piscataway, New Jersey (1992) 187-196
107. Prawitz D. Ideas and results in proof theory. In: Fenstad J.E. (Ed). Proceedings of the Second Scandinavian Logic Symposium (1970), North-Holland, Amsterdam
108. Pudlák P. Cuts, consistency statements and interpretation. Journal of Symbolic Logic 50 (1985) 423-441
109. Pudlák P. On the lengths of proofs of finitistic consistency statements in first order theories. In: Paris J.B., Wilkie A.J., and Wilmers G.M. (Eds). Logic Colloquium '84 (1986), North-Holland, Amsterdam 165-196
110. Pudlák P. Improved bounds to the lengths of proofs of finitistic consistency statements. In: Simpson S.G. (Ed). Logic and Combinatorics. vol. 65 of Contemporary Mathematics (1987), American Mathematical Society, Providence, Rhode Island 309-331
111. Pudlák P. Ramsey's theorem in bounded arithmetic. In: Börger E., et al. (Ed). Computer Science Logic '90. Lecture Notes in Computer Science #533 (1991), Springer-Verlag, Berlin 308-312
112. Pudlák P. Lower bounds for resolution and cutting planes proofs and monotone computations. Journal of Symbolic Logic 62 (1997) 981-998
113. Rabin M.O. Decidable theories. In: Barwise J. (Ed). Handbook of Mathematical Logic (1977), North-Holland, Amsterdam 595-629
114. A. A. Razborov [n.d.] Lower Bounds for the Polynomial Calculus. To appear in Computational Complexity.
115. English translation in: Soviet Mathem. Doklady, 31, pp. 354-357. Razborov A.A. Lower bounds on the monotone complexity of some boolean functions. Doklady Akademii Nauk SSSR 282 (1985) 1033-1037
116. Razborov A.A. On provably disjoint NP-pairs. Tech. Rep. RS-94-36 November (1994), Basic Research in Computer Science Center, Aarhus, Denmark. http://www.brics.dk/index.html
117. Razborov A.A. Lower bounds for propositional proofs and independence results in Bounded Arithmetic. In: Meyer auf der Heide F., and Monien B. (Eds). Automata, languages and programming: 23rd international colloquium, ICALP '96. Lecture Notes in Computer Science #1099 (1996), Springer-Verlag, Berlin 48-62
118. Razborov A.A., Widgerson A., and Yao A.C.-C. Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus. Proceedings of the 29th Annual ACM Symposium on the Theory of Computing. Association for Computing Machinery, New York (1997) 739-748
119. Technical Report #87. Reckhow R.A. On the Lengths of Proofs in the Propositional Calculus. PhD thesis (1976), Department of Computer Science, University of Toronto
120. Riis S., and Sitharam M. Non-constant Degree Lower Bounds imply Linear Degree Lower Bounds. Tech. Rep. TR97-048, Colloquium on Computation Complexity. ECCC (1997). http://www.eccc.unitrier.de/eccc/
121. Russell B. The theory of implication. American Journal of Mathematics 28 (1906) 159-202
122. Smullyan R.M. First-Order Logic (1968), Springer-Verlag, Berlin
123. preprint. Solovay R.M. Upper Bounds on the Speedup of GB over ZF (1990)
124. Statman R. Complexity of derivations from quantifier-free Horn formulae, mechanical introduction of explicit definitions, and refinement of completeness theorems. In: Gandy R.O., and Hyland J.M.E. (Eds). Logic Colloquium '76 (1977), North-Holland, Amsterdam 505-517
125. Statman R. Proof search and speed-up in the predicate calculus. Annals of Mathematical Logic 15 (1978) 225-287
126. Statman R. Speed-up by theories with infinite models. Proceedings of the American Mathematical Society 81 (1981) 465-469
127. Takeuti G. Proof Theory. 2nd ed. (1987), North-Holland, Amsterdam
128. Takeuti G. Some relations among systems for bounded arithmetic. In: Petkov P.P. (Ed). Mathematical Logic, Proceedings of the Heyting 1988 Summer School (1990), Plenum Press, New York 139-154
129. Tarski A. Der Warheitsbegriff in den formalisierten Sprachen. Studia Philosophica, Commentarii Societatis Philosophicae Polonorum 1 (1936) 261-405
130. G. S. Tsejtin [1968] On the complexity of derivations in propositional calculus, in: Studies in mathematics and mathematical logic, Part II, A. O. Slisenko, ed., pp. 115-125. in Russian.
131. In Russian. Tsejtin G.S., and Čubarjan A.A. On some bounds to the lengths of logical proofs in classical propositional calculus. Trudy Vyčisl. Centra AN ArmSSR i Erevan. Univ. 8 (1975) 57-64
132. Vaught R.L. On axiomatizability by a schema. Journal of Symbolic Logic 32 (1967) 473-479
133. Yao A.C.-C. Separating the polynomial time hierarchy by oracles. Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Piscataway, New Jersey (1985) 1-10