The Decision On The Minimal Covering Of Regular Separable Sets In Partial Multiple-Valued Logic

Multiple-valued logic is an important branch of the computerscience and technology. Multiple-valued logic studies the theory ofmultiple-valued logic, multiple-valued circuit & multiple-valuedsystem, and the applications of multiple-valued logic. In the theory of K-valued logic, one primary and importantproblem is the completeness of function sets, which can be solveddepending on the decision for all the precomplete sets (maximal closedsets) of K-valued function sets noted by PK . And another important *problem in K-valued logic completeness theory is the decision forSheffer functions, which can be totally solved by picking out all of theminimal covering of the precomplete sets (maximal closed sets). In chapter 1, the achievement on multiple-valued logic at home andabroad is introduced briefly. In chapter 2, some decisions for theminimal covering of the regular separable sets in partialmultiple-valued logic is studied under the condition of σ=e andm=2 . We reach some conclusions that certain regular separable setsmustn't be the minimal covering of Pk under some conditions.