Some results on the minimal coverings of precomplete classes in partial k-valued logic functions
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, some Full Symmetric Function Sets (m = 3) are proved to be components of the minimal covering of precomplete classes in P(k)(*).
precomplete class completeness multiple-valued logic sheffer function