On definability in dependence logic Juha Kontinen, Jouko V-bäänänen-A Abstract: We study the expressive power of open formulas of Dependence Logic. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic. Keywords: dependence logic; independence friendly logic; team; trump