Page 1

Displaying 1 – 3 of 3

Showing per page

Weighted sums of aggregation operators.

Tomasa Calvo, Bernard De Baets, Radko Mesiar (1999)

Mathware and Soft Computing

The aim of this work is to investigate when a weighted sum, or in other words, a linear combination, of two or more aggregation operators leads to a new aggregation operator. For weights belonging to the real unit interval, we obtain a convex combination and the answer is known to be always positive. However, we will show that also other weights can be used, depending upon the aggregation operators involved. A first set of suitable weights is obtained by a general method based on the variation of...

Wide sets, deep many-valuedness and sorites arguments.

Carlos Pelta (2004)

Mathware and Soft Computing

In this article I show how to obtain a powerful and truthful explanation of the failure of sorites arguments combining an adaptation of the Wide Set Theory formulated by Formato and Gerla and the concept of deep many valuedness established by Marraud. It is shown that if the premises of a sorites argument are conceived as a succession of indexed consequence operators (where indices express the accuracy of the inferences) prefixing sentences, the argument fails because the transitive property for...

Currently displaying 1 – 3 of 3

Page 1