Fuzzy Galois connections on fuzzy sets

In fairly elementary terms this paper presents how the theory of preordered fuzzy sets, more precisely quantale-valued preorders on quantale-valued fuzzy sets, is established under the guidance of enriched category theory. Motivated by several key results from the theory of quantaloid-enriched categories, this paper develops all needed ingredients purely in order-theoretic languages for the readership of fuzzy set theorists, with particular attention paid to fuzzy Galois connections between preordered fuzzy sets.Comment: 30 pages, final versio

Relational Galois connections between transitive fuzzy digraphs

Fuzzy-directed graphs are often chosen as the data structure to model and implement solutions to several problems in the applied sciences. Galois connections have also shown to be useful both in theoretical and in practical problems. In this paper, the notion of relational Galois connection is extended to be applied between transitive fuzzy directed graphs. In this framework, the components of the connection are crisp relations satisfying certain reasonable properties given in terms of the so-called full powering

Conference Program

Document provides a list of the sessions, speakers, workshops, and committees of the 32nd Summer Conference on Topology and Its Applications

On multidimensional poverty rankings of binary attributes

We address the problem of ranking distributions of attributes in terms of poverty, when the attributes are represented by binary variables. To accomplish this task, we identify a suitable notion of “multidimensional poverty line” and characterize axiomatically the Head-Count and the Attribute-Gap poverty rankings, which are the natural counterparts of the most widely used income poverty indices. Finally, we apply our methodology and compare our empirical results with those obtained with some other well-known poverty measures