No abstract

Insertion of lattice-valued functions in a monotone manner is investigated. For L a -separable completely distributive lattice (i.e. L admits a countable base which is free of supercompact elements), a monotone version of the Kat¥tovTong insertion theorem for L-valued functions is established. We also provide a monotone lattice-valued version of Urysohn's lemma. Both results yield new characterizations of monotonically normal spaces. Moreover, extension of lattice-valued functions under additional assumptions is shown to characterize also monotone normality.

No abstract

No abstract

Aggregation functions are mathematical operators that merge given data in order to obtain a global value that preserves the information given by the data as much as possible. In most practical applications, this value is expected to be between the infimum and the supremum of the given data, which is guaranteed only when the aggregation functions are idempotent. Ordered weighted averaging (OWA) operators are particular cases of this kind of function, with the particularity that the obtained global value depends on neither the source nor the expert that provides each datum, but only on the set of values. They have been classified by means of the orness-a measurement of the proximity of an OWA operator to the OR-operator. In this paper, the concept of orness is extended to the framework of idempotent aggregation functions defined both on the real unit interval and on a complete lattice with a local finiteness condition.

No abstract

No abstract

No abstract