What aggregation rules can be classified as logical concepts?

In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such rules. Our primary tools are methods of universal algebra and the theory of closed classes of discrete functions.