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 条

[21] A SUFFICIENT CONDITION FOR CLOSED CLASSES OF K-VALUED LOGIC TO HAVE ONLY TRIVIAL CONGRUENCES
GORLOV, VV
MATHEMATICS OF THE USSR-SBORNIK, 1981, 38 (04): : 507 - 532
[22] Some results on the minimal coverings of precomplete classes in partial k-valued logic functions
Liu, RR
Chen, SQ
Chen, JE
Li, S
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (06) : 981 - 985
[23] FUNCTIONAL STABILITY CONDITIONS FOR LOGIC DEVICES OF K-VALUED LOGIC
VASILIEVA, NP
IEEE TRANSACTIONS ON MAGNETICS, 1970, MAG6 (04) : 844 - +
[24] Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
Orlov, VA
DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 223 - 233
[25] ONE CLASS OF FUNCTIONS OF K-VALUED LOGIC
DENISOVA, RA
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1984, 24 (01): : 108 - 110
[26] ON THE NUMBER OF MONOTONIC FUNCTIONS FROM 2-VALUED LOGIC TO K-VALUED LOGIC
HROMKOVIC, J
KYBERNETIKA, 1985, 21 (03) : 228 - 234
[27] POLYNOMIAL FORMS OF PARTIAL FUNCTIONS OF K-VALUED LOGIC
AVSARKISYAN, GS
CYBERNETICS, 1985, 21 (04): : 450 - 456
[28] S-SYSTEMS OF FUNCTIONS OF K-VALUED LOGIC
KUDRYAVT.VB
DOKLADY AKADEMII NAUK SSSR, 1971, 199 (01): : 20 - &
[29] A METHOD OF CONSTRUCTING FAST ALGORITHMS IN THE K-VALUED LOGIC
ALEKSEEV, VB
EMELYANOV, NR
MATHEMATICAL NOTES, 1985, 38 (1-2) : 595 - 600
[30] RECOGNITION OF PROPERTIES IN K-VALUED LOGIC AND APPROXIMATE ALGORITHMS
ALEKSEYEV, VB
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 10 - 13

← 1 2 3 4 5 →