首页 | 本学科首页   官方微博 | 高级检索  
     

A semantically complete extension sequence of the system (?)
引用本文:裴道武,王国俊. A semantically complete extension sequence of the system (?)[J]. 中国科学F辑(英文版), 2003, 0(2)
作者姓名:裴道武  王国俊
作者单位:Institute of Mathematics,Shaanxi Normal University,Institute of Mathematics,Shaanxi Normal University Xi'an 710062,China Department of Mathematics,Yancheng Teachers College,Yancheng 224002,China,Xi'an 710062,China
基金项目:This work was supported by the National Natural Science Foundation of China (Grant No. 19831040).
摘    要:In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the prepositional calculus formal system (?)*. The partial constant values are taken as formulas, formulas are fuzzified in two manners of semantics and syntax, and inferring processes are fuzzified. A sequence of new extensions {(?)_n~*} of the system ? is proposed, and the completeness of (?)_n~* is proved.


A semantically complete extension sequence of the system (?)
PEI Daowu WANG Guqjun. A semantically complete extension sequence of the system (?)[J]. Science in China(Information Sciences), 2003, 0(2)
Authors:PEI Daowu WANG Guqjun
Affiliation:PEI Daowu WANG Guqjun1. Institute of Mathematics,Shaanxi Normal University,Xi'an 710062,China,2. Department of Mathematics,Yancheng Teachers College,Yancheng 224002,China
Abstract:In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the prepositional calculus formal system (?)*. The partial constant values are taken as formulas, formulas are fuzzified in two manners of semantics and syntax, and inferring processes are fuzzified. A sequence of new extensions {(?)_n~*} of the system ? is proposed, and the completeness of (?)_n~* is proved.
Keywords:fuzzy logic   propositional calculus system (?)   extension (?)_n   completeness.
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号