The Truth Table Algorithm

In order to illustrate the Truth Table Algorithm, we use Pennings’ data ( 2003). His is a fuzzy-set QCA, but the same principles and practices apply to crisp-set QCA. Pennings is interested in the conditions for high constitutional control of the executive in parliamentary democracies (K). He identifies the presence of a consensus democracy (C), a strong presidentialist component in the political system (P), whether the democracy is new (N), and the rigidity of the constitution (R) as potential conditions. The data matrix in Table 7.1 displays each case’s fuzzy-set membership in all conditions and the outcome.