Some Results on the Decision of the Minimal Covering for Full Symmetric Function Sets in Partial K-valued Logic
部分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.