Pages that link to "Item:Q3010365"
From MaRDI portal
The following pages link to On the Proof Complexity of Cut-Free Bounded Deep Inference (Q3010365):
Displaying 6 items.
- Extension without cut (Q714731) (← links)
- Complexity of Deep Inference via Atomic Flows (Q2904403) (← links)
- On the proof complexity of deep inference (Q2946572) (← links)
- On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)
- A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae (Q3066096) (← links)
- A Subatomic Proof System for Decision Trees (Q5056373) (← links)