 for negations of dependence atoms (Väänänen 2007a,b). The resulting language is expressively equivalent to negation-free dependence logic, and, in fact, the description of dependence logic of (Väänänen 2007a) considers this negation as part of its language; however, as shown in (Kontinen &amp; Väänänen 2011), the satisfaction conditions of a dependence logic formula and those of its negation have little connection to one another. More precisely: