2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/229279We 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.LogicA semantical proof of the strong normalization theorem for full propositional classical natural deductiontext