 The problem of judgment aggregation can be formalized as follows. Let \(N = \{1, 2, \ldots ,n\}\) be a set of individuals \((n \ge 2)\). The propositions on which judgments are to be made are represented by sentences from propositional logic (or some other, expressively richer logic, such as a predicate, modal, or conditional logic, as discussed in Dietrich 2007). We define the agenda, \(X\), as a finite set of propositions, closed under single negation  \((\neg)\).[11]  For example, \(X\) could be \(\{p, \neg p, p\rightarrow q, \neg(p\rightarrow q), q, \neg q\}\), as in the expert-panel case.