On the computational complexity of cut reduction (0)

by K Aelig, A Beckmann
Venue:Annals of Pure and Applied Logic