This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Yasuhito Tanaka ()
Abstract

No abstract is available for this item.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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: http://hdl.handle.net/10.1007/s10203-009-0085-8
File Format: text/html
File Function:
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Publisher Info
Article provided by Springer in its journal Decisions in Economics and Finance.

Volume (Year): 32 (2009)
Issue (Month): 1 (May)
Pages: 67-78
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:spr:decfin:v:32:y:2009:i:1:p:67-78

Contact details of provider:
Web page: http://link.springer.de/link/service/journals/10203/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).

Related research
Keywords: Quasi-transitive social choice rule; Vetoer; Oligarchy; Infinite society; Nonsolvable problem; Halting problem;

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

  1. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer, vol. 10(2), pages 257-276. [Downloadable!] (restricted)
    Other versions:
  2. Mas-Colell, Andreu & Sonnenschein, Hugo, 1972. "General Possibility Theorems for Group Decisions," Review of Economic Studies, Blackwell Publishing, vol. 39(2), pages 185-92, April. [Downloadable!] (restricted)
  3. Fishburn, Peter C., 1970. "Arrow's impossibility theorem: Concise proof and infinite voters," Journal of Economic Theory, Elsevier, vol. 2(1), pages 103-106, March. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? You too can volunteer for RePEc, for example by editing a NEP report.

This page was last updated on 2009-11-14.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.