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

DOI10.1007/s10203-009-0085-8zbMath1165.91366OpenAlexW2138440971MaRDI QIDQ1022421

Yasuhito Tanaka

Publication date: 22 June 2009

Published in: Decisions in Economics and Finance (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10203-009-0085-8

zbMATH Keywords

halting problemvetoeroligarchyinfinite societynonsolvable problemquasi-transitive social choice rule

Mathematics Subject Classification ID

Social choice (91B14)

Cites Work

• Arrow's theorem and Turing computability
• On the computability of binary social choice rules in an infinite society and the halting problem
• General Possibility Theorems for Group Decisions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem