■ukasiewicz命题逻辑系统中有限命题集的约简理论

在n值■ukasiewicz命题逻辑中提出了命题集Γ的约简理论,引入由命题集Γ所诱导的形式背景的概念,从Γ及其子集的关系出发给出了n值命题逻辑中有限命题集Γ约简的判定定理以及求Γ约简的方法。说明了无穷值■ukasiewicz命题逻辑中命题集Γ的约简可转化为n值情形。

Reduction theory of finite proposition set in £ukasiewicz propositional logic

The theory of Г-reduction in n-valued £ukasiewicz propositional logic is introduced，the formal context of the propositional set Г is introduced and investigated.Several ways to determine the Г-reduction are studied by investigating the relationship between Г and their subsets.The reduction of propositional set Г in £ukasiewicz infinite valued logic can be reduced to n-valued £ukasiewicz propositional logic.