由于格值逻辑中广义文字结构的复杂性,这必然增加判断两个广义文字是否为α-归结对的难度。根据真值域L_n×L_2的结构特性和归结水平α的特点,研究了真值域为一类格蕴涵代数L_n×L_2的格值命题逻辑系统(L_n×L_2)P(X)中0-IESF与其他广义文字之间的α-归结性,得到了两个广义文字可进行α-归结的条件。
Because of the complexity of generalized literals structure in lattice-valued logic, it leads to difficult to judge two generalized literals whether form resolution pair or not. According to particular structure of truth valued range L_n×L_2 and the characteristic of resolution level α, the resolvability of between 0-IESF and other generalized literals in lattice-valued propositional logic system(L_n×L_2)P( X ) based on one class of lattice implication algebras L_n× L_2, and the determination conditions on that two generalized literals can form resolution pair.