Voting by eliminating quantifiers

Dov M. Gabbay, Andrzej Szałas

Research output: Contribution to journalArticlepeer-review


Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the "best compromise" varies and heavily depends on a particular situation.The method we propose in this paper depends on expressing individual preferences of voters and specifying properties of the resulting ranking by means of first-order formulas. Then, as a technical tool, we use methods of second-order quantifier elimination to analyze and compute results of voting. We show how to specify voting, how to compute resulting rankings and how to verify voting protocols.

Original languageEnglish
Pages (from-to)365-379
Number of pages15
JournalStudia Logica
Issue number3
StatePublished - Aug 2009

Bibliographical note

Funding Information:
Supported in part by the MNiSW grant N N206 399134.


  • Quantifier elimination
  • Social choice
  • Voting


Dive into the research topics of 'Voting by eliminating quantifiers'. Together they form a unique fingerprint.

Cite this