Refined Complexity Analysis of Cut Elimination

@inproceedings{Gerhardy2003RefinedCA,
  title={Refined Complexity Analysis of Cut Elimination},
  author={Philipp Gerhardy},
  booktitle={CSL},
  year={2003}
}
In [1, 2] Zhang shows how the complexity of cut elimination depends primarily on the nesting of quantifiers in cut formulas. By studying the role of contractions in cut elimination we can refine that analysis and show how the complexity depends on a combination of contractions and quantifier nesting. With the refined analysis the upper bound on cut elimination coincides with Statman’s lower bound. Every non-elementary growth example must display a combination of nesting of quantifiers and… CONTINUE READING

From This Paper

Topics from this paper.
14 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The Length of Proofs

  • P. Pudlak
  • In Buss, S.R., ed.: Handbook of Proof Theory…
  • 1998
Highly Influential
7 Excerpts

Lower Bounds on Herbrand’s Theorem

  • R. Statman
  • Proc. of the Amer. Math. Soc. 75
  • 1979
Highly Influential
9 Excerpts

Improved Complexity Analysis of Cut Elimination and Herbrand’s Theorem

  • P. Gerhardy
  • Master’s thesis
  • 2003
Highly Influential
7 Excerpts

Proof Theory : Some Applications of Cut-Elimination

  • H. Schwichtenberg
  • In Barwise, J., ed.: Handbook of Mathematical…
  • 1977
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…