4.7 Article

On the number of aggregation functions on finite chains as a generalization of Dedekind numbers

Journal

FUZZY SETS AND SYSTEMS
Volume 466, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.fss.2022.11.012

Keywords

Dedekind numbers; Number of aggregation functions; Free algebra; Aggregation clone

Ask authors/readers for more resources

The paper aims to demonstrate that the cardinality of the set of all n-ary aggregation functions defined on finite chains can be considered as a dual generalization of Dedekind numbers. The first generalization naturally arises from the commonly used definition of aggregation function. The second generalization follows in the spirit of Dedekind's original definition by showing that n-ary aggregation functions equipped with certain operations form a free algebra in a finitely generated variety over the set of n generators.
The aim of this paper is to show that the cardinality of the set of all n-ary aggregation functions defined on finite chains can be seen as a two-fold generalization of Dedekind numbers. One generalization arises naturally from the commonly used definition of aggregation function. The second one goes in the spirit of the former Dedekind's definition, i.e., it is shown that n-ary aggregation functions equipped with certain operations form a free algebra in a finitely generated variety over the set of n generators. & COPY; 2022 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available