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

Simple item page
dc.creatorNour, Karim
dc.creatorSaber, Khelifa
dc.date2009-05-04
dc.date.accessioned2026-07-07T13:11:25Z
dc.date.available2026-07-07T13:11:25Z
dc.descriptionWe give in this paper a short semantical proof of the strong normalization for full propositional classical natural deduction. This proof is an adaptation of reducibility candidates introduced by J.-Y. Girard and simplified to the classical case by M. Parigot.
dc.identifierhttps://arxiv.org/abs/0905.0358
dc.identifierhttp://arxiv.org/abs/0905.0358
dc.identifierArchive for Mathematical Logic 45, 3 (2006) 357-364
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229279
dc.subjectLogic
dc.titleA semantical proof of the strong normalization theorem for full propositional classical natural deduction
dc.typetext

Files

Collections

arXiv