计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (5): 28-29.

• 学术探讨 • 上一篇    下一篇

正则可离关系之最小覆盖成员的判定结果

刘玉珍 刘任任   

  1. 湘潭大学信息工程学院 湘潭大学信息工程学院计算机系
  • 收稿日期:2006-06-07 修回日期:1900-01-01 出版日期:2007-02-11 发布日期:2007-02-11
  • 通讯作者: 刘玉珍

Results on decision of the minimal covering members for regular separable relation

Liu Yuzhen   

  • Received:2006-06-07 Revised:1900-01-01 Online:2007-02-11 Published:2007-02-11
  • Contact: Liu Yuzhen

摘要: :根据部分K值逻辑完备性理论,得到了当 , 时,若正则可离关系 之关系图的基础图连通,则 不是 的最小覆盖成员的结论。

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

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 be connected under the condition of and .Then must not belong to the minimal covering of .
Key words: multiple-valued logic; completeness; Sheffer function; maximal closed sets (precomplete sets); minimal covering;regular separable relation

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