This 4-lecture course aims to provide a concise introduction to dependence logic and its proof-theoretic aspects.

Dependence logic was introduced by Väänänen (2007) as a novel formalism for expressing and reasoning about dependence and independence relations. The logic adopts the team semantics of Hodges (1997). The basic idea of team semantics is that dependency properties can only manifest themselves in multitudes, and thus formulas of dependence logic are evaluated on sets of assignments (called teams) instead of single assignment as in the usual Tarskian semantics. A team can be naturally viewed as a relational database, a dataset, an information state, etc. Thanks to the simple structure of teams and the abundance of their interpretations in various fields of science, team semantics and dependence logic have been investigated recently to address issues in database theory, linguistics, quantum foundations, social choice and so on.