 A pair &lt;W, R&gt; is a Chellas frame (or just a frame) iff W is a non-empty set, intuitively understood as a set of information states, and R ⊆ W × W × ℘(W), where ℘( W) is the powerset of W. Instead of Rww′ X one usually writes wRXw′. Let W, R be a frame such that for all X ⊆ W and w, w′ ∈ W, wRXw′ implies w′ ∈ X. Then M = &lt;W, R, v+, v−&gt; is a model for the connexive conditional logic CCL iff v+ and v− are valuation functions from the set of propositional variables into ℘( W), the support of truth and support of falsity conditions for propositional variables, negated formulas, conjunctions, and disjunctions are defined as in the case of C-models and, moreover,