The paper introduces a new type of rules into Natural Deduction, elimination rules by composition. Elimination rules by composition replace usual elimination rules in the style of disjunction elimination and give a more direct treatment of additive disjunction, multiplicative conjunction, existence quantifier and possibility modality. Elimination rules by composition have an enormous impact on proof-structures of deductions: they do not produce segments, deduction trees remain binary branching, there is no vacuous discharge, there is only few need of permutations. This new type of rules fits especially to substructural issues, so it is shown for Lambek Calculus, i.e. intuitionistic non-commutative linear logic and to its extensions by structural rules like permutation, weakening and contraction. Natural deduction formulated with elimination rules by composition from a complexity perspective is superior to other calculi.

本文在自然推导中引入了一种新的规则类型，即“按组成规则消除规则”。通过构图的消除规则以析取消除的方式代替了通常的消除规则，并且对加法析取，乘法相加，存在量词和可能性模态进行了更直接的处理。按组成的消除规则对推论的证明结构有巨大影响：它们不产生片段，推论树仍然是二元分支，没有空虚放电，只需要很少的排列。这种新类型的规则特别适合于子结构问题，因此对Lambek微积分显示，即直觉非交换线性逻辑及其通过排列，弱化和收缩等结构规则的扩展。