# Arrow's Theorem and Turing computability

@article{Mihara1994ArrowsTA, title={Arrow's Theorem and Turing computability}, author={H. R. Mihara}, journal={Economic Theory}, year={1994}, volume={10}, pages={257-276} }

Summary. A social welfare function for a denumerable society satisfies Pairwise Computability if for each pair (x,y) of alternatives, there exists an algorithm that can decide from any description of each profile on {x,y} whether the society prefers x to y. I prove that if a social welfare function satisfying Unanimity and Independence also satisfies Pairwise Computability, then it is dictatorial. This result severely limits on practical grounds Fishburn's resolution (1970) of Arrow's… Expand

#### 38 Citations

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

- Mathematics, Computer Science
- Appl. Math. Comput.
- 2008

2- PDF

Arrow's Theorem, Weglorz' Models and the Axiom of Choice

- Mathematics, Computer Science
- Math. Log. Q.
- 2000

3

Existence of a coalitionally strategyproof social choice function: A constructive proof

- Mathematics, Computer Science
- Soc. Choice Welf.
- 2001

19

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

- Mathematics
- 2009

- PDF

Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society

- Mathematics, Computer Science
- Appl. Math. Comput.
- 2007

4- PDF

The Arrow Impossibility Theorem Of Social Choice Theory In An Infinite Society And Limited Principle Of Omniscience

- Mathematics
- 2008

2

Computability of Simple Games: A Characterization and Application to the Core

- Mathematics, Computer Science
- ArXiv
- 2007

7- PDF

#### References

SHOWING 1-10 OF 20 REFERENCES

Anonymity and neutrality in Arrow’s Theorem with restricted coalition algebras

- Mathematics, Economics
- 1994

27

On effectively computable realizations of choice functions : Dedicated to Professors Kenneth J. Arrow and Anil Nerode

- Mathematics
- 1985

76

Computability, complexity, and languages - fundamentals of theoretical computer science

- Mathematics, Computer Science
- Computer science and applied mathematics
- 1983

299

Recursively enumerable sets and degrees - a study of computable functions and computability generated sets

- Computer Science
- Perspectives in mathematical logic
- 1987

284- PDF