部分K值逻辑中完满对称函数集最小覆盖判定的一些结果

Some Results on the Decision of the Minimal Covering for Full Symmetric Function Sets in Partial K-valued Logic

根据部分K值逻辑的完备性理论,从二元完满对称关系G2的关系图的特点出发,首先证明了两类保二元的完满对称函数集不属于部分K值逻辑的准完备集之最小覆盖。然后对关系图中边的数目分情况进行讨论,定出了部分K值逻辑中保二元的完满对称函数集在边数小于等于K时的准完备集之最小覆盖成员。

According to the completeness theory in partial K-valued logic,starting with the chart of binary full symmetric relations,this paper first proved two kinds of preserving binary full symmetric relations function sets unbelong to the minimal covering members in partial K-valued logic,and then discussed the edge number of chart,decided the emergence of preserving binary full symmetric relations function sets in the minimal covering members in partial K-valued logic.