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 sy

First Page		Document Content
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 sy Add to Reading List Source URL: www.anupamdas.com Download Document from Source Website File Size: 366,67 KB Share Document on Facebook