On the Strong Normalisation of Natural Deduction with Permutation-Conversions
Abstract
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simulation.