Examples of $\alpha$-complete systems of $k$-valued logic for $k=3,4$
Diskretnaya Matematika, Tome 18 (2006) no. 4, pp. 45-55
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
In the paper, we prove the $\alpha$-completeness of finite systems of function of $k$-valued logic for $k=3,4$ containing all permutations of the symmetric group $S_k$ on the set $E_k=\{0,1,\dots,k-1\}$, the operation of addition modulo $k$, and $k$ certain binary operation. This result is extended to some other systems of functions which are obtained by replacing the operation of addition by some quasi-group operation.
[1] Glukhov M. M., “Ob $\alpha$-zamknutykh klassakh i $\alpha$-polnykh sistemakh funktsii $k$-znachnoi logiki”, Diskretnaya matematika, 1:1 (1989), 16–21
[2] Chernyshov A. L., “Usloviya $\alpha$-polnoty sistem funktsii mnogoznachnoi logiki”, Diskretnaya matematika, 4:4 (1992), 117–130 | MR
[3] Belousov V. D., Osnovy teorii kvazigrupp i lup, Nauka, Moskva, 1967
[4] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, Moskva, 1979