Year: 2026
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Poliakov, Nikolay L.
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7148634845
Cites:
Cited by:
Related to: