complexity of cut elimination

[martdowd at aol.com]

FOM,
I've started looking in to the complexity of propositional cut elimination.  From what I've read so far, it's seems that there are procedures that require only elementary time.  Is it known whether the height of the stack of 2's can be bounded?
- Martin Dowd
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20201221/741d4967/attachment.html>