K^(*)∀谓词逻辑系统中相似度及伪距离研究  

Research on similarity degree and pseudo-distance in K^(*)∀ predicate logic system

作　　者：鲁星 惠小静[1] 王波 LU Xing;HUI Xiaojing;WANG Bo(College of Mathematics and Computer Science,Yan’an University,Yan’an 716000,China)

机构地区：[1]延安大学数学与计算机科学学院,陕西延安716000

出　　处：《延安大学学报（自然科学版）》2022年第4期103-107,共5页Journal of Yan'an University：Natural Science Edition

基　　金：国家自然科学基金项目(12261090)。

摘　　要：从一阶逻辑系统的相似度出发,结合谓词演算系统K^(*)∀,以公理化真度为基础讨论了公式之间相似度和伪距离的运算性质,对相似度性质进行了简化,并对K^(*)∀中闭公式相似度及伪距离的计算方法和性质作进一步推广。In this paper,starting from the similarity of first-order logic system,the properties of similarity operation with strong equivalent operators are given in predicate calculus system K^(*)∀. Then the properties of similarity are simplified according to the properties of axiomatic truth degree,and the calculation methods and properties of similarity degree and pseudo-distance of K^(*)∀ closed formula are generalized.

关 键 词：K^(*)∀谓词逻辑系统 相似度 伪距离 

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