Pages that link to "Item:Q3522034"
From MaRDI portal
The following pages link to Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof (Q3522034):
Displaying 5 items.
- Formalized meta-theory of sequent calculi for substructural logics (Q1744443) (← links)
- A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082) (← links)
- Formalized meta-theory of sequent calculi for linear logics (Q2424887) (← links)
- General Bindings and Alpha-Equivalence in Nominal Isabelle (Q5892493) (← links)
- (Q6060676) (← links)
