A New Linear Time Correctness Condition for Multiplicative Linear Logic
share
In this paper, we give a new linear time correctness condition for proof nets of Multiplicative Linear Logic without units. Our approach is based on a rewriting system over trees. We have only three rewrite rules. Compared to previous linear time correctness conditions, our system is surprisingly simple and intuitively appealing.
READ FULL TEXT