P*4中保二元正则可离关系非最小覆盖的剔除

J4 ›› 2008, Vol. 43 ›› Issue (12): 24-27.

P^*₄中保二元正则可离关系非最小覆盖的剔除

周小强¹,刘任任²

1. 湖南理工学院数学系, 湖南岳阳 414006; 2. 湘潭大学信息工程学院, 湖南湘潭 411105

收稿日期:2008-09-02 出版日期:2008-12-16 发布日期:2009-11-09
通讯作者: 周小强 zxq0923@163.com

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

ZHOU Xiao-qiang¹, LIU Ren-ren²

1. Department of Mathematics,Hunan Institute of Science and Technology, Yueyang 414006, Hunan， China;
2. College of Information Engineering, Xiangtan University, Xiangtan 411105, Hunan, China

Received:2008-09-02 Online:2008-12-16 Published:2009-11-09

摘要/Abstract

摘要：

为确定部分四值逻辑的最小覆盖,根据部分K值逻辑的完备性理论、正则可离关系以及准完备集之间的相似关系理论, 对部分四值逻辑的最小覆盖进行分析,证明了270个保二元正则可离关系函数集中的222个函数集必不属于部分四值逻辑中最小覆盖的成员。

关键词: 多值逻辑; Sheffer函数; 正则可离关系; 最小覆盖

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, the minimal covering 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 covering members in partial four-valued logic.

Key words: multi-valued logic; Sheffer functions; regularly separable relation; minimal covering

中图分类号:

TP301

周小强刘任任. P^*₄中保二元正则可离关系非最小覆盖的剔除[J]. J4, 2008, 43(12): 24-27.

ZHOU Xiao-qiang, LIU Ren-ren. Elimination of the not minimal covering of preserving binary regularly separable relations in partial four-valued logic[J]. J4, 2008, 43(12): 24-27.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed

[1]	刘惊雷王玲玲张伟. 角色分配格的生成算法[J]. J4, 2009, 44(11): 52-56.
[2]	杨玉珍刘培玉朱振方邱烨. 应用特征项分布信息的信息增益改进方法研究[J]. J4, 2009, 44(11): 48-51.

P^*₄中保二元正则可离关系非最小覆盖的剔除

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

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

多维度评价

本文评价

推荐阅读 0