LP(X)中MP归结推理

MP Resolution Inference in LP(X)

首先讨论格值命题逻辑系统LP(X)中子句的规则型范式以及极简规则型子句集的形式,然后定义MP归结式以及(A,α)-归结演绎、α-逻辑推理以及α-不可满足,讨论了它们的一系列逻辑性质,最后证明了MP归结推理的可靠性以及弱完备性。

This paper first discuss the forms of the ruled normal form and the extra simple ruled clause set for formula of lattice-valued propositional logic system LP （X）, then define the deceptions of MP resolvent, （A,a）-resolution inference, a-logical inference and properties are discussed. The soundness theorem and weak proved a-unsatisfiability, especially a series of logical completeness theorem of MP resolution are proved in the end.