Pages that link to "Item:Q2368983"
From MaRDI portal
The following pages link to Structure of proofs and the complexity of cut elimination (Q2368983):
Displaying 15 items.
- Cut formulas in propositional logic (Q689298) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Algebraic aspects of cut elimination (Q1770974) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- (Q2958526) (← links)
- (Q3384900) (← links)
- Unwinding a Non-effective Cut Elimination Proof (Q3434700) (← links)
- Input Proofs and Rank One Cutting Planes (Q4018154) (← links)
- (Q4283227) (← links)
- (Q4362908) (← links)
- (Q4601841) (← links)
- Cut-Elimination for SBL (Q5013907) (← links)
- (Q5219931) (← links)
- Computer Science Logic (Q5292638) (← links)