A strong normalization result for classical logic

DOI10.1016/0168-0072(95)00004-ZzbMath0832.03028MaRDI QIDQ1902976

Stefano Berardi, Franco Barbanera

Publication date: 5 March 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

classical logicreduction rulesstrong normalization proof

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Related Items (3)

Strong normalization of the second-order symmetric \(\lambda \mu\)-calculus ⋮ Programming and Proving with Classical Types ⋮ Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus

Cites Work

• Mathematical significance of consistency proofs
• Intensional interpretations of functionals of finite type I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A strong normalization result for classical logic