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 the publication of Arrow's celebrated impossibility result, the French mathematician 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: jeu simple; agrégation; ultrafiltre; agrégation des jugements; connecteurs logiques; simple game; aggregation; ultrafilter; judgement aggregation; logical connectives (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Published in Mathematics and Social Sciences, 2010, 189, pp.19-35

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:hal-00642163

Access Statistics for this paper

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