10 search results - page 1 / 2 » On the Strong Normalisation of Natural Deduction with Permut... |
RTA
1999
Springer
14 years 2 months ago
1999
Springer
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-simu...
APAL
2008
13 years 10 months ago
2008
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper...
APAL
2010
13 years 10 months ago
2010
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. When defined with general elimination/application rules, natural deduction and λ-calculus become closer to sequent calculus. In order to get real isomorphism, normalisa...
TLCA
2001
Springer
14 years 2 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...