|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 5, Pages 80–97
(Mi da666)
|
|
|
|
About finding of maximal subclones in weak-central clone
N. G. Parvatov Tomsk State University, Tomsk, Russia
Abstract:
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, Galois connection, completeness problem, weak-central predicate, central predicate, weak-central clone.
Received: 14.06.2011
Citation:
N. G. Parvatov, “About finding of maximal subclones in weak-central clone”, Diskretn. Anal. Issled. Oper., 18:5 (2011), 80–97
Linking options:
https://www.mathnet.ru/eng/da666 https://www.mathnet.ru/eng/da/v18/i5/p80
|
Statistics & downloads: |
Abstract page: | 296 | Full-text PDF : | 78 | References: | 53 | First page: | 3 |
|