2013/04/24 by Daniel de Carvalho, Lorenzo Tortora de Falco, de Carvalho, Daniel +1 · 1 citation
Computer Science · Mathematics · #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO #math.LO
paper · pdf · doi:10.48550/arxiv.1304.6762
41 pages
arxiv created 2014/08/26 · arxiv updated 2014/08/28
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.