On the Proof Complexity of Cut-Free Bounded Deep Inference

DOI10.1007/978-3-642-22119-4_12zbMath1333.03239OpenAlexW1559475567MaRDI QIDQ3010365

Anupam Das

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22119-4_12

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Complexity of proofs (03F20)

Related Items (3)

A Subatomic Proof System for Decision Trees ⋮ On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ Extension without cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension without cut
• On the proof complexity of deep inference
• Normalisation Control in Deep Inference via Atomic Flows
• The relative efficiency of propositional proof systems
• A Proof Calculus Which Reduces Syntactic Bureaucracy
• Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
• Logical Approaches to Computational Barriers

This page was built for publication: On the Proof Complexity of Cut-Free Bounded Deep Inference