Conjunctions, disjunctions and Lewisian semantics for counterfactuals

Consider the reasonable axioms of subjunctive conditionals (1) if p square -> q(1 and) p square -> q(2) at some world, then p square -> (q(1) & q(2)) at that world, and (2) if p(1) square -> q and p(2) square -> q at some world, then (p(1) v p(2)) square -> q at that world, where p square -> q is the subjunctive conditional. I show that a Lewis-style semantics for subjunctive conditionals satisfies these axioms if and only if one makes a certain technical assumption about the closeness relation, an assumption that is probably false. I will then show how Lewisian semantics can be modified so as to assure (1) and (2) even when the technical assumption fails, and in fact in one sense the semantics actually becomes simpler then.