Voting by eliminating quantifiers

DOI10.1007/s11225-009-9200-7zbMath1187.91051OpenAlexW1989138721MaRDI QIDQ1037605

Dov M. Gabbay, Andrzej Szałas

Publication date: 16 November 2009

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: http://orbilu.uni.lu/handle/10993/15947

zbMATH Keywords

quantifier eliminationvotingsocial choice

Mathematics Subject Classification ID

Voting theory (91B12) Social choice (91B14) Quantifier elimination, model completeness, and related topics (03C10)

Cites Work

• Tournament solutions and majority voting
• Computing circumscription revisited: A reduction algorithm
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• Handbook of social choice and welfare. Vol. 1.
• The paradox of multiple elections
• The state of SAT
• On the Fixpoint Theory of Equality and Its Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Voting by eliminating quantifiers