Results

**1 - 5**of**5**### Strong normalization of classical natural deduction with disjunctions

"... This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conju ..."

Abstract
- Add to MetaCart

(Show Context)
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedded into natural deduction with general elimination rules, strictly preserving proof normalization.

### Karim NOUR and Khelifa SABER

, 905

"... A semantical proof of the strong normalization theorem for full propositional classical natural deduction ..."

Abstract
- Add to MetaCart

(Show Context)
A semantical proof of the strong normalization theorem for full propositional classical natural deduction

### Digital Object Identifier (DOI): 10.1007/s00153-005-0314-y

, 2004

"... A semantical proof of the strong normalization theorem for full propositional classical natural deduction ..."

Abstract
- Add to MetaCart

(Show Context)
A semantical proof of the strong normalization theorem for full propositional classical natural deduction

### Strong normalization results by translation

"... 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 λµ-calculus. We also extend Mendler’s result on recursive equations to this system. 1 ..."

Abstract
- Add to MetaCart

(Show Context)
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 λµ-calculus. We also extend Mendler’s result on recursive equations to this system. 1