On the Strong Normalisation of Natural Deduction with Permutation-Conversions

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.

• Type: Conference
• Year: 1999
• Where: RTA
• Authors: Philippe de Groote
• Keywords: Modular Proof, RTA 1999, Strong Normalisation, Theoretical Computer Science