On the Computational Complexity of Cut-Elimination in Linear Logic

Harry G. Mairson, Kazushige Terui. On the Computational Complexity of Cut-Elimination in Linear Logic. In Carlo Blundo, Cosimo Laneve, editors, Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings. Volume 2841 of Lecture Notes in Computer Science, pages 23-36, Springer, 2003. [doi]

Abstract

Abstract is missing.