The Determination on Minimal Covering of Regular Separable Function Sets in Partial Four-Valued Logic

In the structure theory of many-valued logic function, the decision and constitution of the Sheffer function is a very important problem, which is reduced to the decision of the minimal covering of precomplete sets in the many-valued logic function sets. According to the completeness theory in partial k-valued logic and the similar relationship theory among precomplete sets, in this paper, the methods of determination on the minimal covering of regular separable function sets are found out, and the minimal covering of regular separable function sets in partial four-valued logic are decided.