On the Proof Complexity of Cut-Free Bounded Deep Inference.

Anupam Das

Browse the full TABLEAUX paper archive.