Short proofs of tautologies using the schema of equivalence

  • Matthias Baaz
  • Richard Zach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 832)


It is shown how the schema of equivalence can be used to obtain short proofs of tautologies A, where the depth of proofs is linear in the number of variables in A.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Krajíček, J. and P. Pudlák. [1988] The number of proof lines and the size of proofs in first order logic. Arch. Math. Logic, 27, 69–84.MathSciNetGoogle Scholar
  2. Schütte, K. [1960] Beweistheorie. Springer, Berlin.Google Scholar
  3. Yukami, T. [1984] Some results on speed-up. Ann. Japan Assoc. Philos. Sci., 6, 195–205.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Matthias Baaz
    • 1
  • Richard Zach
    • 2
  1. 1.Institut für Algebra und diskrete Mathematik E118.2Technische Universität WienWienAustria
  2. 2.Institut für Computersprachen E185.2Technische Universität WienWienAustria

Personalised recommendations