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 - Bath - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2012-02-03 19:34:56 Open Document File Size: 366,67 KB Share Result on Facebook

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 List