DESCRIPTION OF THE FAMILY OF G-COMPLETE CLASSES OF K-VALUED LOGIC

被引:0
|
作者
HOA, NV
机构
来源
CYBERNETICS | 1990年 / 26卷 / 05期
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The traditional completeness problem of k-valued logic is replaced with the G-completeness problem of identification of functions with an identical stabilizer in the group generated by all permutations of variables. The set of closed classes separating those that are G-complete from those that are not G-complete is shown to be infinite for k greater-than-or-equal-to 3.
引用
收藏
页码:629 / 634
页数:6
相关论文
共 50 条