Guilbaud’s 1952 theorem on the logical problem of aggregation

Mathématiques et sciences humaines. Mathematics and social sciences

Monjardet, Bernard¹  Eckert, Daniel¹ 

关键词: simple game;    aggregation;    ultrafilter;    judgement aggregation;    logical connectives;   

DOI  :  10.4000/msh.11677

学科分类：数学（综合）

来源: College de France * Ecole des Hautes Etudes en Sciences Sociales (E H E S S)

【 摘 要 】

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.

【 授权许可】

Unknown