Affiliation:
1. MIT-IBM Watson AI Lab, IBM T. J. Watson Research Center
Abstract
The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar inequalities exist in algebras of multi-valued logic when the multiplication and addition operations are replaced with various T-norms and T-conorms respectively. For instance, we show that the rearrangement inequality holds when the T-norms and T-conorms are derived from Archimedean copulas.