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.