We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly normalizable) compute the maximal length of the reduction sequences starting from that net.
de Carvalho, D., TORTORA DE FALCO, L. (2013). A semantic account of Strong Normalization in Linear Logic, arXiv:1304.6762v2 [abs/1304.6762].
A semantic account of Strong Normalization in Linear Logic, arXiv:1304.6762v2
TORTORA DE FALCO, LORENZO
2013-01-01
Abstract
We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly normalizable) compute the maximal length of the reduction sequences starting from that net.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
