基于零级泛与运算的谓词形式系统及其完备性  

Predicate Formal System Based on 0-level Universal and Operator and its Completeness

作　　者：马盈仓[1,2] 何华灿[3] 

机构地区：[1]西北工业大学电子信息学院,西安710072 [2]西安工程大学理学院,西安710048 [3]西北工业大学计算机学院,西安710072

出　　处：《小型微型计算机系统》2011年第10期2105-2108,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60273087,60575034)资助;陕西省教育厅专项科研计划项目(2010JK567)资助;西北工业大学基础研究基金项目(W018101)资助

摘　　要：泛逻辑是在研究柔性世界逻辑规律时发现的一个新的连续值的逻辑体系,它通过引入广义相关性和广义自相关性刻画命题之间的相互关系.本文主要解决基于零级泛与运算的一阶谓词演算形式系统ULh∈(0,1]的完备性.通过引入全称量词和存在量词,建立与命题形式系统ULh∈(0,1]相对应的一阶谓词形式系统ULh∈(0,1],并证明其完备性定理.从而得到系统ULh∈(0,1]的语义和语构是和谐的.Universal logic is a new continuous-valued logic system in studying flexible world′s logical rule,which uses generalized correlation and generalized autocorrelation to describe the relationship between propositions.The main aim of this paper is solving the completeness of first-order predicate calculus formal system ULh∈（0,1] based on 0-level universal and operator.By introducing the universal quantifier and existential quantifier,the predicate calculus formal deductive system ULh∈（0,1] based on 0-level universal and operator according to propositional calculus formal deductive system ULh∈（0,1] of universal logic is built up,moreover,the completeness theorem of system ULh∈（0,1] are proved.So it shows that the semantic and syntactic of system ULh∈（0,1] are harmony.

关 键 词：泛逻辑 谓词演算形式系统 泛与运算 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]