In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this pape...In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minimal covering of precomplete classes inP k * . Keywords multiple-valued logic - completeness - Sheffer function - precomplete class NoteThis work is supported by the National Natural Science Foundation of China (Grant Nos.60083001 and 60375021).展开更多
文摘In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minimal covering of precomplete classes inP k * . Keywords multiple-valued logic - completeness - Sheffer function - precomplete class NoteThis work is supported by the National Natural Science Foundation of China (Grant Nos.60083001 and 60375021).
