Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
From MaRDI portal
Publication:3522034
DOI10.1007/978-3-540-70590-1_28zbMath1146.68041OpenAlexW1961313574MaRDI QIDQ3522034
Publication date: 28 August 2008
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_28
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A formally verified cut-elimination procedure for linear nested sequents for tense logic ⋮ Formalized meta-theory of sequent calculi for linear logics ⋮ Unnamed Item ⋮ Formalized meta-theory of sequent calculi for substructural logics ⋮ General Bindings and Alpha-Equivalence in Nominal Isabelle
Uses Software
This page was built for publication: Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
