On the computational complexity of cut-reduction

Klaus Aehlig Arnold Beckmann On the computational complexity of cut-reduction http://arxiv.org/abs/0712.1499 2007 CoRR abs/0712.1499 db/journals/corr/corr0712.html#abs-0712-1499 informal publication