On the computability of binary social choice rules in an infinite society and the halting problem
From MaRDI portal
Publication:2479229
Recommendations
- On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem
- Arrow's theorem and Turing computability
- The arrow impossibility theorem of social choice theory in an infinite society and limited principle of omniscience
- Social choice and computational complexity
- An infinite version of Arrow's theorem in the effective setting
Cites work
- Arrow's theorem and Turing computability
- scientific article; zbMATH DE number 3720907 (Why is no real title available?)
- scientific article; zbMATH DE number 2182815 (Why is no real title available?)
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- Social choice and individual values
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
Cited in
(4)- Undecidability of the existence of dictator for strongly candidate stable voting procedures in an infinite society and Cantor's diagonal argument
- On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem
- Arrow's theorem and Turing computability
- Computable economics: reconstructing the nonconstructive
This page was built for publication: On the computability of binary social choice rules in an infinite society and the halting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479229)