The Lengths of Proofs

This publication has 47 references indexed in Scilit:

• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
  computational complexity, 1996
• An exponential separation between the parity principle and the pigeonhole principle
  Annals of Pure and Applied Logic, 1996
• Cutting planes, connectivity, and threshold logic
  Archive for Mathematical Logic, 1996
• The complexity of the Pigeonhole Principle
  Combinatorica, 1994
• Exponential lower bounds for the pigeonhole principle
  computational complexity, 1993
• Upper bound on the lengthening of proofs by cut elimination
  Journal of Mathematical Sciences, 1986
• Cuts, consistency statements and interpretations
  The Journal of Symbolic Logic, 1985
• Axiomatizability by a schema
  The Journal of Symbolic Logic, 1968
• Untersuchungen ber das logische Schlie en. II
  Mathematische Zeitschrift, 1935
• Untersuchungen ber das logische Schlie en. I
  Mathematische Zeitschrift, 1935