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

Anupam Das (2011)

Details and statistics

DOI: 10.1007/978-3-642-22119-4_12

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.