arnold beckmann's pages

On the computational complexity of cut-reduction

File: PDF-File

Author: Klaus T Aehlig and Arnold Beckmann
Title: On the computational complexity of cut-reduction
Proceedings: Logic in Computer Science, 2008. LICS '08. 23rd Annual IEEE Symposium on 24-27 June 2008
Pages: 284 - 293
DOI: 10.1109/LICS.2008.9

Abstract: Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and 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.

websites: Arnold Beckmann 2018-04-07 Valid HTML 4.01! Valid CSS!