It is able to change the law of excluded middle into all kinds of tautology through applications of the rule of equivalent replacement and to prove all the inner theorems of propositional logic .

在此基础上给出一机器能行算法，把 排中律等值置换成 任一 重言 式，证明任一命题逻辑内定理。