首页 | 官方网站   微博 | 高级检索  
     

P*4中保四元正则可离关系非最小覆盖的剔除*
引用本文:周小强,刘任任.P*4中保四元正则可离关系非最小覆盖的剔除*[J].计算机应用研究,2009,26(6):2090-2091.
作者姓名:周小强  刘任任
作者单位:1. 湖南理工学院,数学系,湖南,岳阳,414006
2. 湘潭大学,信息工程学院,湖南,湘潭,411105
基金项目:国家自然科学基金资助项目(606731931);湖南省教育厅资助项目(07A067,08C390)
摘    要:为确定部分四值逻辑的最小覆盖,根据部分K值逻辑的完备性理论、正则可离关系以及准完备集之间的相似关系理论, 对部分四值逻辑的最小覆盖进行分析,证明了109个保四元正则可离关系函数集中的67个函数集必不属于部分四值逻辑中最小覆盖的成员。

关 键 词:多值逻辑  完备性  正则可离关系  最小覆盖

Elimination of not belonging to minimal covering of preserving quaternary regularly separable relations in partial four valued logic
ZHOU Xiao qiang,LIU Ren ren.Elimination of not belonging to minimal covering of preserving quaternary regularly separable relations in partial four valued logic[J].Application Research of Computers,2009,26(6):2090-2091.
Authors:ZHOU Xiao qiang  LIU Ren ren
Affiliation:(1.Dept. of Mathematics, Hunan Institute of Science & Technology,Yueyang Hunan 414006, China;2.College of Information Engineering, Xiangtan University, Xiangtan Hunan 411105, China)
Abstract:To determine the minimal covering in partial four-valued logic,according to the completeness theory in partial K-valued logic,regularly separable relation and the similar relationship theory among precomplete sets,analyzed the minimal covering in partial four-valued logic,and proved 67 sets of 109 preserving quaternary regularly separable relations function sets not belong to the minimal covering members in partial four-valued logic.
Keywords:multi-valued logic  completeness  regularly separable relations  minimal covering  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号