On the computability of binary social choice rules in an infinite society and the halting problem (Q2479229): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:45, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computability of binary social choice rules in an infinite society and the halting problem |
scientific article |
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
