Skip to main content
Conference Proceedings

On the strong normalisation of natural deduction with permutation-conversions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1631 45-59
DOI: 10.1007/3-540-48685-2_4
10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

de Groote, P. (1999). On the strong normalisation of natural deduction with permutation-conversions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1631, pp. 45–59). Springer Verlag. https://doi.org/10.1007/3-540-48685-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free