Advanced Search
MyIDEAS: Login to save this article or follow this journal

A Representation Theorem For Voting With Logical Consequences


Author Info

Registered author(s):


    This paper concerns voting with logical consequences, which means that anybody voting for an alternative x should vote for the logical consequences of x as well. Similarly, the social choice set is also supposed to be closed under logical consequences. The central result of the paper is that, given a set of fairly natural conditions, the only social choice functions that satisfy social logical closure are oligarchic (where a subset of the voters are decisive for the social choice). The set of conditions needed for the proof include a version of Independence of Irrelevant Alternatives that also plays a central role in Arrow s impossibility theorem.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    File Function: link to article abstract page
    Download Restriction: no

    Bibliographic Info

    Article provided by Cambridge University Press in its journal Economics and Philosophy.

    Volume (Year): 22 (2006)
    Issue (Month): 02 (July)
    Pages: 181-190

    as in new window
    Handle: RePEc:cup:ecnphi:v:22:y:2006:i:02:p:181-190_00

    Contact details of provider:
    Postal: The Edinburgh Building, Shaftesbury Road, Cambridge CB2 2RU UK
    Fax: +44 (0)1223 325150
    Web page:

    Related research



    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Christian List, 2007. "Group deliberation and the transformation ofjudgments: an impossibility result," STICERD - Political Economy and Public Policy Paper Series 26, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
    2. Pivato, Marcus, 2008. "The Discursive Dilemma and Probabilistic Judgement Aggregation," MPRA Paper 8412, University Library of Munich, Germany.
    3. Dokow, Elad & Holzman, Ron, 2010. "Aggregation of binary evaluations with abstentions," Journal of Economic Theory, Elsevier, vol. 145(2), pages 544-561, March.
    4. Frederik Herzberg, 2008. "Judgment aggregation functions and ultraproducts," Working Papers 405, Bielefeld University, Center for Mathematical Economics.
    5. Christian List, 2007. "Group deliberation and the transformation of judgments: an impossibility result," LSE Research Online Documents on Economics 19273, London School of Economics and Political Science, LSE Library.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:cup:ecnphi:v:22:y:2006:i:02:p:181-190_00. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Keith Waters).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.