Sciweavers

LICS
2008
IEEE
13 years 11 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann