 A path-connected agenda (or totally blocked, in Nehring and Puppe 2002, Other Internet Resources): Any pair of contingent propositions in \(X\) is connected by a path of conditional entailments. Formally, for any contingent \(p, q \in X\), there exist \(p_1, p_2 , \ldots ,p_k \in X\) with \(p_1 = p\) and \(p_k = q\) such that \(p_1\) conditionally entails \(p_2, p_2\) conditionally entails \(p_3,\ldots\), and \(p_{k-1}\) conditionally entails \(p_k\). (Here, \(p_i\) conditionally entails \(p_j\) if \(p_i \cup Y\) entails \(p_j\) for some \(Y \subseteq X\) consistent with each of \(p_i\) and \(\neg p_j\); and \(p\) is contingent if neither \(\{p\}\), nor \(\{\neg p\}\) is logically inconsistent.)