Guilbaud's 1952 theorem on the logical problem of aggregation

Daniel Eckert () and Bernard Monjardet

Post-Print from HAL

Abstract: In a paper published in 1952, shortly after publication of Arrow's celebrated impossibility result, the French mathematicien Georges-Théodule Guilbaud has obtained a dictatorship result for the logical problem of aggregation, thus anticipating the literature on abstract aggregation theory and judgment aggregation. We reconstruct the proof of Guilbaud's theorem, which is also of technical interest, because it can be seen as the first use of ultrafilters in social choice theory.

Keywords: Agrégation; agrégation des jugements; connecteurs logiques; jeu simple; ultrafiltre; logical connectives; Aggregation; judgment aggregation; simple game; ultrafilter (search for similar items in EconPapers)
Date: 2010-06
Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00504959v1
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in 2010

Downloads: (external link)
https://shs.hal.science/halshs-00504959v1/document (application/pdf)

Related works:
Working Paper: Guilbaud's 1952 theorem on the logical problem of aggregation (2010)
Working Paper: Guilbaud's 1952 theorem on the logical problem of aggregation (2010)
Working Paper: Guilbaud's 1952 theorem on the logical problem of aggregation (2010)
Working Paper: Guilbaud's 1952 theorem on the logical problem of aggregation (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-00504959

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().