Aggregating Credences into Beliefs: Agenda Conditions for Impossibility Results

Binarizing belief aggregation addresses how to rationally aggregate individual probabilistic beliefs into collective binary beliefs. Similar the development of judgment theory, formulating axiomatic requirements, proving impossibility theorems, and identifying exact agenda conditions theorems are natural important research topics in binarizing aggregation. Building on our previous we use an agenda-theoretic approach generalize results determine necessary sufficient level logical interconnection between issues for arise. We demonstrate that (1) path-connectedness even-negatability constitute condition oligarchy result stating satisfying proposition-wise independence deductive closure yields oligarchies under minor conditions; (2) negation-connectedness is triviality obtained by adding anonymity result; (3) blockedness result, which follows completeness consistency Moreover, compare these novel findings with existing characterization binarization.