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

• Articles • Previous Articles     Next Articles

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

 ZHOU Xiao-qiang1, LIU Ren-ren2   

  1. 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:

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

CLC Number: 

  • TP301
[1] LIU Jing-Lei, WANG Ling-Ling, ZHANG Wei. Generation algorithm for the role assigning lattice [J]. J4, 2009, 44(11): 52-56.
[2] YANG Yu-Zhen, LIU Pei-Yu, SHU Zhen-Fang, QIU Ye. Research of an improved information gain methodusing distribution information of terms [J]. J4, 2009, 44(11): 48-51.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!