Some results on the decision and construction for Sheffer functions in partial k-valued logic

Decisions and construction for Sheffer functions in P_k and P_k* in partial k-valued logic are considered. The solution of these problems depends on the solution of the decision problem of completeness in P _k and P_k* and is reduced to determining the minimal coverings of precomplete classes in P _k and P_k*, respectively. The pseudo-linear function set denoted by L_p is proved here to be the component part of the minimal covering of precomplete classes in P_k*