Abstract:

According to the completeness theory in partial kvalued logic, firstly, the number of preserving binary full symmetric function sets is determined for general K, and the method of constructing these function sets is given out; secondly, the number of all full symmetric function sets is determined for general K, and the method of constructing these function sets is given out.

Key words: multiplevalued logic；precomplete sets；full symmetric function sets