P4^＊中保四元正则可离关系最小覆盖之确定  

Decision on Minimal Covering of Preserving Quaternary Regularly Separable Relations in Partial Four-valued Logic

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

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

出　　处：《计算机科学》2009年第9期176-177,192,共3页Computer Science

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

摘　　要：根据部分K值逻辑的完备性理论、正则可离关系以及准完备集之间的相似关系理论,对部分四值逻辑中最小覆盖的确定进行分析,定出了部分四值逻辑中保四元正则可离关系函数集之最小覆盖成员。According to the completeness theory in partial K-valued logic, regularly separable relation and the similar relationship theory among precomplete sets, the decision of minimal covering in partial four-valued logic was analyzed, and the minimal covering members of function sets preserving quaternary regularly separable relations in partial four-valued logic were decided.

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

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