Pages that link to "Item:Q5458060"
From MaRDI portal
The following pages link to Towards an algorithmic construction of cut-elimination procedures (Q5458060):
Displaying 13 items.
- Cut elimination for GLS using the terminability of its regress process (Q288243) (← links)
- Extension without cut (Q714731) (← links)
- Algebraic aspects of cut elimination (Q1770974) (← links)
- Cut-elimination for \(\omega_{1}\) (Q1799034) (← links)
- Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination (Q2350976) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Towards Algorithmic Cut-Introduction (Q2891453) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- Cut Elimination for Shallow Modal Logics (Q3010370) (← links)
- Cut-Elimination and Proof Schemata (Q3455184) (← links)
- Cut-Elimination for SBL (Q5013907) (← links)
- Computer Science Logic (Q5292638) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)
