Pages that link to "Item:Q3623221"
From MaRDI portal
The following pages link to Proof Complexity of the Cut-free Calculus of Structures (Q3623221):
Displaying 10 items.
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Extension without cut (Q714731) (← links)
- A proper hierarchy of propositional sequent calculi (Q1350509) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- On the Power of Substitution in the Calculus of Structures (Q2946759) (← links)
- From Deep Inference to Proof Nets via Cut Elimination (Q3094143) (← links)
- (Q4283227) (← links)
- A Subatomic Proof System for Decision Trees (Q5056373) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)