Some results on the minimal coverings of precomplete classes in partialk-valued logic functions
- First Online:
- 20 Downloads
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 inPk*.
Keywordsmultiple-valued logic completeness Sheffer function precomplete class
Unable to display preview. Download preview PDF.