On the computability of binary social choice rules in an infinite society and the halting problem (Q2479229)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5253909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computability of binary social choice rules in an infinite society and the halting problem |
scientific article; zbMATH DE number 5253909 |
Statements
On the computability of binary social choice rules in an infinite society and the halting problem (English)
0 references
26 March 2008
0 references
arrow impossibility theorem
0 references
infinite society
0 references
nonsolvable problem
0 references
halting problem
0 references
0 references
0.9250075817108154
0 references
0.8456656336784363
0 references
0.8065071702003479
0 references
0.7839361429214478
0 references
0.7741294503211975
0 references
