3 papers
econ.TH2026
What aggregation rules can be classified as logical concepts?
Nikolay L. Poliakov
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…
econ.GN2016
Note on level r consensus
Nikolay L. Poliakov
We show that the hierarchy of level consensus partially collapses. In particular, any profile that exhibits consensus of level around in f…
math.LO2012
On algorithmic decidability of the square-free word problem relative to a system of two defining relations
Nikolay L. Poliakov
The square-free word problem relative to a system of two defining relations is decidable.