Some results on the minimal coverings of precomplete classes in partialk-valued logic functions Academic Article uri icon

abstract

  • 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, some Full Symmetric Function Sets (m = 3) are proved to be components of the minimal covering of precomplete classes in Pk*.

published proceedings

  • Journal of Computer Science and Technology

author list (cited authors)

  • Liu, R., Chen, S., Chen, J., & Li, S.

citation count

  • 5

complete list of authors

  • Liu, Ren-Ren||Chen, Song-Qiao||Chen, Jian-Er||Li, Shu

publication date

  • December 2004