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

Reduction theory of finite proposition set in ■ukasiewicz propositional logic

作　　者：李立峰[1] 张建科[1] 冯锋[1] 

机构地区：[1]西安邮电学院应用数理系,西安710121

出　　处：《计算机工程与应用》2009年第7期44-45,51,共3页Computer Engineering and Applications

基　　金：陕西省教育厅科研计划项目(No.08JK432)

摘　　要：在n值■ukasiewicz命题逻辑中提出了命题集Γ的约简理论,引入由命题集Γ所诱导的形式背景的概念,从Γ及其子集的关系出发给出了n值命题逻辑中有限命题集Γ约简的判定定理以及求Γ约简的方法。说明了无穷值■ukasiewicz命题逻辑中命题集Γ的约简可转化为n值情形。The theory of Г-reduction in n-valued L 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 Lukasiewicz infinite valued logic can be reduced to n-valued Lukasiewiez propositional logic.

关 键 词：■ukasiewicz命题逻辑 完备性定理 Γ约简 形式背景 

分 类 号：O142[理学—数学]