Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (23): 38-39.

• 学术探讨 • Previous Articles     Next Articles

Some results on decision for minimal covering in partial K-valued logic

LIU Yu-zhen,LIU Ren-ren   

  1. College of Information Engineering,Xiangtan University,Xiangtan,Hunan 411105,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-11 Published:2007-08-11
  • Contact: LIU Yu-zhen

部分K值逻辑中最小覆盖之判定的一些结果

刘玉珍,刘任任   

  1. 湘潭大学 信息工程学院,湖南 湘潭 411105
  • 通讯作者: 刘玉珍

Abstract: According to the completeness theory of partial K-valued logic,it is proved that if let the basic graph of the regular separable relation G2=G2({1,2})∪G2 be N-cycle under the condition of m=2 and σ=e,then T(G2) is not in the minimal covering of PK*.

Key words: multiple-valued logic, completeness, Sheffer function, maximal closed sets(precomplete sets), minimal covering

摘要: 根据部分K值逻辑完备性理论,证明了当m=2,σ=e时,若正则可离关系G2=G2({1,2})∪G2之关系图的基础图仅为N图,则T(G2)不是PK*的最小覆盖成员。

关键词: 多值逻辑, 完备性, Sheffer函数, 极大封闭集(准完备集), 最小覆盖