Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (23): 52-57.

Previous Articles     Next Articles

Minimal covering for precomplete sets in partial four-valued logic

GONG Zhiwei1, LIU Renren2   

  1. 1.School of Sciences, Central South University of Forestry and Technology, Changsha 410004, China
    2.College of Information Engineering, Xiangtan University, Xiangtan, Hunan 411105, China
  • Online:2012-08-11 Published:2012-08-21

部分四值逻辑中准完备集的最小覆盖

龚志伟1,刘任任2   

  1. 1.中南林业科技大学 理学院,长沙 410004
    2.湘潭大学 信息工程学院,湖南 湘潭 411105

Abstract: According to the completeness theory and the similar relationship theory among precomplete sets in partial k-valued logic, the minimal covering for all precomplete sets in partial four-valued logic is decided. The judgement of the Sheffer function in partial four-valued logic is solved.

Key words: multiple-valued logic, minimal covering, sheffer function

摘要: 根据部分[K]值逻辑的完备性理论以及准完备集之间的相似关系理论,定出了部分四值逻辑的所有准完备集的最小覆盖,从而解决了部分四值逻辑中Sheffer函数的判定问题。

关键词: 多值逻辑, 最小覆盖, Sheffer函数