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 problem, the solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, some simple separable function sets (m=2) are proved to be the component part of the minimal covering of precomplete classes in P*/sub k/.