Some results on decision of basic groups and basic semigroups in partial multiple-valued logic

Completeness theory of function sets in multiple-valued logic includes three famous problems, that is to decide all precomplete classes in complete k-valued logic functions , partial k-valued logic functions and unary k-valued logic functions, respectively, where k>;1. In this paper, for the third problem, some results on the decision problem of basic groups in partial multiple-valued logic are present; meanwhile, it is proved that the precomplete classes which include non-trivial unary semigroup are fully determined by singular semigroup.