About finding of maximal subclones in weak-central clone
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 5, pp. 80-97
Voir la notice de l'article provenant de la source Math-Net.Ru
The completeness problem in weak-central clone is considered. General conditions are formulated for finding the maximal subclones of such clone. Explicit description of maximal subclones with so-called weak essential functions is received in the case of weak-central clone defined by a hereditary set system. Bibliogr. 14.
Keywords:
closed class, clone, predicate, preserving the predicate, completeness problem, weak-central predicate, central predicate, weak-central clone.
Mots-clés : Galois connection
Mots-clés : Galois connection
@article{DA_2011_18_5_a4,
author = {N. G. Parvatov},
title = {About finding of maximal subclones in weak-central clone},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {80--97},
publisher = {mathdoc},
volume = {18},
number = {5},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2011_18_5_a4/}
}
N. G. Parvatov. About finding of maximal subclones in weak-central clone. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 5, pp. 80-97. http://geodesic.mathdoc.fr/item/DA_2011_18_5_a4/