Arrow's Impossibility Theorem

Freek Wiedijk 1
  • 1 Institute for Computing and Information Sciences, Radboud University Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands

Arrow's Impossibility Theorem

A formalization of the first proof from [6].

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(2):377-382, 1990.

  • [2] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.

  • [3] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.

  • [4] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.

  • [5] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.

  • [6] John Geanakoplos. Three brief proofs of arrow's impossibility theorem. Cowles Foundation Discussion Papers 1123R3, Cowles Foundation, Yale University, April 1996. Available at http://ideas.repec.org/p/cwl/cwldpp/1123r3.html

  • [7] Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics.

  • [8] Andrzej Trybulec. Function domains and Fránkel operator. Formalized Mathematics, 1(3):495-500, 1990.

  • [9] Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9-11, 1990.

  • [10] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.

  • [11] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.

  • [12] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.

  • [13] Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.

OPEN ACCESS

Journal + Issues

Search