Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (34): 17-20.DOI: 10.3778/j.issn.1002-8331.2010.34.006

• 博士论坛 • Previous Articles     Next Articles

Predicate formal system VUL-h∈[0.75,1] and its completeness

MA Ying-cang1,3,HE Hua-can2   

  1. 1.School of Electronics and Information,Northwestern Polytechnical University,Xi’an 710072,China
    2.School of Computer Science,Northwestern Polytechnical University,Xi’an 710072,China
    3.School of Science,Xi’an Polytechnic University,Xi’an 710048,China
  • Received:2010-09-08 Revised:2010-10-25 Online:2010-12-01 Published:2010-12-01
  • Contact: MA Ying-cang

谓词形式系统VUL-h∈[0.75,1]及其完备性

马盈仓1,3,何华灿2   

  1. 1.西北工业大学 电子信息学院,西安 710072
    2.西北工业大学 计算机学院,西安 710072
    3.西安工程大学 理学院,西安 710048
  • 通讯作者: 马盈仓

Abstract: The main aim of this paper is solving the completeness of first-order predicate calculus formal system VUL-h∈[0.75,1] based on first-level universal AND operator.By introducing the universal quantifier and existential quantifier,the predicate calculus formal deductive system VUL-h∈[0.75,1] based on 0-level universal AND operator according to propositional calculus formal deductive system VUL-h∈[0.75,1]of universal logic is built up,moreover,the completeness theorem of system is proved.So it shows that the semantic and syntactic of system VUL-h∈[0.75,1]are harmony.

Key words: universal logic, predicate calculus formal system, universal AND operator

摘要: 主要解决基于一级泛与运算的一阶谓词演算形式系统VUL-h∈[0.75,1]的完备性。通过引入全称量词和存在量词,建立与命题形式系统VUL-h∈[0.75,1]相对应的一阶谓词形式系统VUL-h∈[0.75,1],证明其完备性定理。从而说明形式系统VUL-h∈[0.75,1]的语义和语构是和谐的。

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

CLC Number: