Some Results on the Properties of Simply Separable Function Set in Partial K-valued Logic
Liu Ren-ren · Computing Technology and Automation · 2004
In multiple-valued logic theories, the discussion and construction for Sheffer function is an important problem. The discussion for Sheffer function and for the completeness of functions is osculated, and the solution of the later problem depends on determining all precomplete classes. For partial multiple-valued logic, the decision problem for completeness had been thoroughly solved by determining all the precomplete classes (seven species altogether), but the discussion and construction for Sheffer functions haven't been solved completely. In this paper, some properties of simply separable function set are discussed.