论文标题
关于命题逻辑的计算有效子系统
On Computationally Efficient Subsystems of Propositional Logic
论文作者
论文摘要
在本文中，我们表明，原始命题逻辑的衍生性问题在添加某种形式的等效形式替代原理时仍可以在多项式时间内解决；而且，在添加了另一种形式的原理后，它变成了co-np-hard。
In this paper, we show that the derivability problem for the primal propositional logic remains solvable in polynomial time upon adding a certain form of the principle of equivalent form substitution; and that, upon adding another form of this principle, it becomes co-NP-hard.
