Research on the similarity among precomplete sets preserving m-ary relations in partial k-valued logic

In multiple-valued logic theories, the characterization of Sheffer functions is an important problem, it includes the decision and construction for Sheffer functions in P_k and P_k*. The solution of these problems depends on the solution of the decision problem for completeness in P_k and P_k*, and reduced to determining the minimal coverings of precomplete sets in P _k and P_k*, respectively. This paper studies some similarity among precomplete sets preserving m-ary relation in P_k ^*