BACK to VOLUME 42 NO.3

Kybernetika 42(3):261-277, 2006.

Aggregation Operators on Partially Ordered Sets and Their Categorical Foundations

Mustafa Demirci


Abstract:

In spite of increasing studies and investigations in the field of aggregation operators, there are two fundamental problems remaining unsolved: aggregation of $L$-fuzzy set-theoretic notions and their justification. In order to solve these problems, we will formulate aggregation operators and their special types on partially ordered sets with universal bounds, and introduce their categories. Furthermore, we will show that there exists a strong connection between the category of aggregation operators on partially ordered sets with universal bounds (\textbf{Agop}) and the category of partially ordered groupoids with universal bounds (\textbf{Pogpu}). Moreover, the subcategories of \textbf{Agop} consisting of associative aggregation operators, symmetric and associative aggregation operators and associative aggregation operators with neutral elements are, respectively, isomorphic to the subcategories of \textbf{Pogpu} formed by partially ordered semigroups, commutative partially ordered semigroups and partially ordered monoids in the sense of Birkhoff. As a justification of the present notions and results, some relevant examples for aggregations operators on partially ordered sets are given. Particularly, aggregation process in probabilistic metric spaces is also considered.


Keywords: category theory; aggregation operator; associative aggregation operator; partially ordered groupoid; partially ordered semigroup; partially ordered monoid;


AMS: 18A15; 03G10; 06F05;


download abstract.pdf


BIB TeX

@article{kyb:2006:3:261-277,

author = {Demirci, Mustafa},

title = {Aggregation Operators on Partially Ordered Sets and Their Categorical Foundations },

journal = {Kybernetika},

volume = {42},

year = {2006},

number = {3},

pages = {261-277}

publisher = {{\'U}TIA, AV {\v C}R, Prague },

}


BACK to VOLUME 42 NO.3