  We study hidden-variable models from quantum mechanics, and their
abstractions in purely probabilistic and relational frameworks, by means of
logics of dependence and independence, based on team semantics. We show that
common desirable properties of hidden-variable models can be defined in an
elegant and concise way in dependence and independence logic. The relationship
between different properties, and their simultaneous realisability can thus
been formulated and a proved on a purely logical level, as problems of
entailment and satisfiability of logical formulae. Connections between
probabilistic and relational entailment in dependence and independence logic
allow us to simplify proofs. In many cases, we can establish results on both
probabilistic and relational hidden-variable models by a single proof, because
one case implies the other, depending on purely syntactic criteria. We also
discuss the no-go theorems by Bell and Kochen-Specker and provide a purely
logical variant of the latter, introducing non-contextual choice as a
team-semantical property.
