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
MA Ying-cang1,3,HE Hua-can2
Received:
Revised:
Online:
Published:
Contact:
马盈仓1,3,何华灿2
通讯作者:
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:
TP18
B815
MA Ying-cang1,3,HE Hua-can2. Predicate formal system VUL-h∈[0.75,1] and its completeness[J]. Computer Engineering and Applications, 2010, 46(34): 17-20.
马盈仓1,3,何华灿2. 谓词形式系统VUL-h∈[0.75,1]及其完备性[J]. 计算机工程与应用, 2010, 46(34): 17-20.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.34.006
http://cea.ceaj.org/EN/Y2010/V46/I34/17