A semantic account of strong normalization in linear logic
Abstract We prove that given two cut free nets of linear logic, by means of their relational interpretations one can determine: 1) whether or not the net obtained by cutting the two nets is strongly normalizable, 2) (in case it is strongly normalizable) the maximum length of the reduction sequences starting from that net. As a by product of our semantic approach, we obtain a new proof of the conservation theorem for Multiplicative Exponential Linear Logic MELL which does not rely on confluence; this yields an alternative proof of strong normalization for MELL
Inf. Comput.