Some results on the decision for Sheffer functions in partial K-valued logic. II
Liu Ren-ren · 2002
In multiple-valued logic theories, the characterization of Sheffer (1913) functions is an important problem, it includes the decision and construction for Sheffer functions in P/sub k/ and P/sub k/*. The solution of these problems depends on the solution of the decision problem of completeness in P/sub k/ and P/sub k/*, and reduced to determining the minimal coverings of precomplete classes in P/sub k/ and P/sub k/* respectively. In this paper, some full symmetric function sets are proved to be the component part of the minimal covering of precomplete classes in P/sub k/*.