Symmetric Normalisation for Intuitionistic Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Symmetric Normalisation for Intuitionistic Logic


We present two proof systems for implication-only intuitionistic logic in the calculus of structures. The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus, but using a non-local rewriting. The second system is the symmetric completion of the first, as normally given in deep inference for logics with a DeMorgan duality: all inference rules have duals, as cut is dual to the identity axiom. We prove a generalisation of cut elimination, that we call symmetric normalisation, where all rules dual to standard ones are permuted up in the derivation. The result is a decomposition theorem having cut elimination and interpolation as corollaries.
Fichier principal
Vignette du fichier
sjs2-final-with-appendix.pdf (370.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01092105 , version 1 (08-12-2014)



Nicolas Guenot, Lutz Strassburger. Symmetric Normalisation for Intuitionistic Logic. CSL-LICS 2014, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603160⟩. ⟨hal-01092105⟩
123 View
158 Download



Gmail Facebook Twitter LinkedIn More