P4^＊中保二元正则可离关系非最小覆盖的剔除  

Elimination of the not minimal covering of preserving binary regularly separable relations in partial four-valued logic

作　　者：周小强[1] 刘任任[2] 

机构地区：[1]湖南理工学院数学系,湖南岳阳414006 [2]湘潭大学信息工程学院,湖南湘潭411105

出　　处：《山东大学学报（理学版）》2008年第12期24-27,共4页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(606731931);湖南省教育厅重点资助项目(07A067);湖南省教育厅资助项目(08C390)

摘　　要：为确定部分四值逻辑的最小覆盖,根据部分K值逻辑的完备性理论、正则可离关系以及准完备集之间的相似关系理论,对部分四值逻辑的最小覆盖进行分析,证明了270个保二元正则可离关系函数集中的222个函数集必不属于部分四值逻辑中最小覆盖的成员。To determine the minimal coveting in partial four-valued logic, according to the completeness theory in partial K-valued logic, regularly separable relation and the sinfilar relationship theory among precomplete sets, the minimal coveting in partial four-valued logic was analyzed, and 222 sets of 270 preserving quaternary regularly separable relations function sets were proved not to belong to the minimal coveting members in partial four-valued logic.

关 键 词：多值逻辑 SHEFFER函数 正则可离关系 最小覆盖 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]