![](https://www.pdfsearch.io/img/64c0909e429a1e0fc5b060031c85aeb4.jpg) Date: 2012-02-03 19:34:56
| | On the Proof Complexity of Cut-Free Bounded Deep Inference Anupam Das University of Bath Abstract. It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent syAdd to Reading ListSource URL: www.anupamdas.comDownload Document from Source Website File Size: 366,67 KBShare Document on Facebook
|