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 with previous linear time correctness conditions, our system is surprisingly simple and intuitively appealing.

翻译：在本文中,我们给无单位的多倍线性线性逻辑验证网提供了一个新的线性时间正确性条件。 我们的方法是基于对树木的重写系统。 我们只有三个重写规则。 与先前的线性时间正确性条件相比, 我们的系统非常简单,直觉地具有吸引力。