Voting Rules for Infinite Sets and Boolean Algebras

Abstract

A voting rule in a Boolean algebra B is an upward closed subset that contains, for each element x ∈ B, exactly one of x and ¬x. We study several aspects of voting rules, with special attention to their relationship with ultrafilters. In particular, we study the set-theoretic hypothesis that all voting rules in the Boolean algebra of subsets of the natural… (More)

Topics

  • Presentations referencing similar topics