Gómez González, DanielMontero De Juan, Francisco Javier2023-06-202023-06-20200488-87242-54-2https://hdl.handle.net/20.500.14352/53435International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (10º,. 2004. Perugia, Italia)As pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upon a sequence of binary opera tors can be justied from an operational argument, by imposing a recursive calculus. Following this recursive approach, it was later proven that under certain regularity conditions, strict increasingness leads to quasi-additive solutions. In this paper we propose an alternative and more general result, avoiding some of those regularity conditions. Moreover, we point out that in practice we should evaluate only those aggregations being allowed by the decision maker. Preference structures are considered as an illustrative example.engbook partopen access510.64Aggregation functionsRecursive rulesFuzzy SetsLógica simbólica y matemática (Matemáticas)1102.14 Lógica Simbólica