Paper: On the Computational Complexity of Cut-Reduction (at LICS 2008)

Authors: Klaus Aehlig Arnold Beckmann

Abstract

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theories can be reobtained in a uniform way.

BibTeX

  @InProceedings{AehligBeckmann-OntheComputationalC,
    author = 	 {Klaus Aehlig and Arnold Beckmann},
    title = 	 {On the Computational Complexity of Cut-Reduction},
    booktitle =  {Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008)},
    year =	 {2008},
    month =	 {June}, 
    pages =      {284--293},
    location =   {Pittsburgh, PA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }