On the minimality of some generating sets of the aggregation clone on a finite chain

被引：8
|
作者：
Halas, Radomir [1 ]
Kuras, Zbynek [1 ]
Pocs, Jozef [1 ,2 ]
机构：
[1] Palacky Univ Olomouc, Fac Sci, Dept Algebra & Geometry, 17 Listopadu 12, Olomouc 77146, Czech Republic
[2] Slovak Acad Sci, Math Inst, Gresakova 6, Kosice 04001, Slovakia
来源：
INFORMATION SCIENCES | 2021年 / 564卷
关键词：
Aggregation clone; Minimal; (chi; circle plus)-generating set; Chain; Aggregation functions;
D O I：
10.1016/j.ins.2021.02.070
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Clone theory plays an important role in studying aggregation functions on bounded posets or bounded lattices. Several important classes of aggregation functions on a bounded lattice L form a clone, particularly the set of all aggregation functions on L, the so-called full aggregation clone on L. For any finite lattice L, this clone is known to be finitely generated and various generating sets and their constructions have been presented in recent papers. The aim of this paper is to extend previous results concerning generating sets of aggregation clones on finite chains. Namely, the objective is to discuss the minimality of certain generating bases, the so-called (chi,circle plus)-generating sets. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码：193 / 201
页数：9
相关论文
共 50 条
12345