On rearrangement inequalities for T-norm logics (2204.06051v7)

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 for multi-valued logic with the multiplication and addition operation 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.