Weakly central clones and completeness problem for them
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 14-16
Cet article a éte moissonné depuis la source Math-Net.Ru
A weakly central clones are introduced and completeness problem for them is considered.
@article{PDM_2011_13_a5,
author = {N. G. Parvatov},
title = {Weakly central clones and completeness problem for them},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {14--16},
year = {2011},
number = {13},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a5/}
}
N. G. Parvatov. Weakly central clones and completeness problem for them. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 14-16. http://geodesic.mathdoc.fr/item/PDM_2011_13_a5/
[1] Parvatov N. G., “O vydelenii maksimalnykh podklonov”, Prikladnaya diskretnaya matematika, 2011, no. 1, 14–25
[2] Agibalov G. P., Diskretnye avtomaty na polureshëtkakh, Izd-vo Tom. un-ta, Tomsk, 1993, 227 pp. | Zbl
[3] Parvatov N. G., “Teorema o funktsionalnoi polnote v klasse kvazimonotonnykh funktsii na konechnoi polureshëtke”, Diskr. analiz i issled. oper. Ser. 1, 13:3 (2006), 62–82 | MR