1) maximal closed sets(precomplete sets)
极大封闭集(准完备集)
2) Precomplete Classes
准完备集(极大封闭集)
4) precomplete sets
准完备集
1.
One important problem in multiple-valued logic theory is the decision on Sheffer functions, which depends on deciding all precomplete sets, and the solution can be reduced to determining the minimal covering of .
此问题的解决依赖于定出所有准完备集,并可归结为定出所有准完备集的最小覆盖。
2.
The determinant algorithm of the Sheffer function in partial three-valued Logic is given,based on the completeness theory in partial k-valued logic and the minimal covering of precomplete sets in partial three-valued logic.
根据部分多值逻辑的完备性理论和部分三值逻辑中准完备集的最小覆盖,给出部分三值逻辑中Sheffer函数的判定算法。
5) minimal complete set
极小完备集
1.
Then the power set 2X of X forms an algebraic system together with four operations: intersection, union,differece and complement,This paper gives several minimal complete sets with above four operations.
选取一个非空集合X作为全集,2~X对交,并,差,补四种运算作成一个代数系统,文中给出了这四种运算的几个极小完备集。
6) closed set
封闭集合
1.
The CloSpan algorithm first suggests that the closed set of sequential patterns is more compact and has the same expressive power with respect to the full sets.
CloSpan算法首先提出搜索封闭集合的思想。
补充资料：嬉集
1.聚集玩乐。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条