Advertisement

Complexity of Cut-Elimination

Chapter
Part of the Trends in Logic book series (TREN, volume 34)

Abstract

Our aim is to compare different methods of cut-elimination. For this aim we need logic-free axioms. The original formulation of LK by Gentzen also served the purpose of simulating Hilbert-type calculi and deriving axiom schemata within fixed proof length. Below we show that there exists a polynomial transformation from an LK-proof with arbitrary axioms of type AA to atomic ones.

References

  1. 15.
    M. Baaz, A. Leitsch: Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57, pp. 181–215, 1992.MathSciNetMATHCrossRefGoogle Scholar
  2. 16.
    M. Baaz, A. Leitsch: On Skolemization and Proof Complexity. Fundamenta Informaticae, 20(4), pp. 353–379, 1994.MathSciNetMATHGoogle Scholar
  3. 28.
    W.S. Brianerd, L.H. Landweber: Theory of Computation. Wiley, New York, NY, 1974.Google Scholar
  4. 38.
    G. Gentzen: Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39, pp. 405–431, 1934–1935.MathSciNetCrossRefGoogle Scholar
  5. 44.
    J. Herbrand: Sur le problème fondamental de la logique mathématique. Sprawozdania z posiedzen Towarzysta Naukowego Warszawskiego, Wydzial III, 24, pp. 12–56, 1931.Google Scholar
  6. 67.
    V.P. Orevkov: Lower Bounds for Increasing Complexity of Derivations after Cut Elimination. Journal of Soviet Mathematics, 20, pp. 2337–2350, 1982.MATHCrossRefGoogle Scholar
  7. 68.
    P. Pudlak: The Lengths of Proofs. In: S.R. Buss (ed.), Handbook of Proof Theory, Elsevier, Amsterdam, 1998.Google Scholar
  8. 72.
    R. Statman: Lower Bounds on Herbrand’s Theorem. Proceedings of the American Mathematical Society 75, pp. 104–107, 1979.MathSciNetMATHGoogle Scholar
  9. 74.
    G. Takeuti: Proof Theory. North-Holland, Amsterdam, 2nd edition, 1987.Google Scholar
  10. 79.
    B. Woltzenlogel Paleo: Herbrand Sequent Extraction. VDM Verlag Dr.Müller e.K., Saarbrücken, , ISBN-10: 3836461528, February 7, 2008.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Vienna University of TechnologyViennaAustria
  2. 2.Vienna University of TechnologyViennaAustria

Personalised recommendations