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

形式布尔算子的命题逻辑
引用本文:邓安生,孙铁利.形式布尔算子的命题逻辑[J].东北师大学报(自然科学版),2000,32(3):99-103.
作者姓名:邓安生  孙铁利
作者单位:东北师范大学计算机科学系,吉林,长春,130024
基金项目:国家自然科学基金资助项目!( 6970 3 0 1 0,69983 0 0 2 )
摘    要:在定量的意义下使模糊命题演算完全包容经典命题逻辑是不可能的。布尔算子命题逻辑用算子和算子的演算定性地描述和处理模糊命题的不确定性,将经典命题逻辑作为其特例。在布尔算子命题逻辑中给出了其公理系统和求公式恒真水平的机械推导算法。

关 键 词:命题逻辑  恒真水平  形式布尔算子  模糊逻辑
文章编号:1000-1832(2000)03-0099-05

Formal boolean operator proposional logic
DENG An-sheng,SUN Tie-li.Formal boolean operator proposional logic[J].Journal of Northeast Normal University (Natural Science Edition),2000,32(3):99-103.
Authors:DENG An-sheng  SUN Tie-li
Institution:DENG An-sheng ,SUN Tie-Ii (Department of Computer Science, Northeast Normal University, Changchun 130024, China)
Abstract:It is impossible for a quantitative fuzzy propositional logic to subsume classical propositional logic. In this paper, Boolean operator propositional logic (BOPL), which is a natural generalization of classical propositional logic, is proposed. In BOPL, the uncertainties of fuzzy propositions are qualitatively characterized by fuzzy operators and their calculi. The axioms of BOPL and an algorithm for truth level of a given formula in BOPL are also provided.
Keywords:Boolean operator proposional logic  truth level  false level  normal form  Wang Hao's algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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