title: A Double Team Semantics for Generalized Quantifiers.
abstract: We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of ageneralized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, ordouble teams. We also devise a game-theoretic semantics equivalent to the double team semantics. We make use of the double team semantics by defining a logic [Formula: see text] which canonically fuses togethertwo-variable dependence logic[Formula: see text] andtwo-variable logic with counting quantifiers[Formula: see text]. We establish that the satisfiability and finite satisfiability problems of [Formula: see text] are complete for [Formula: see text].
authors.affiliation: Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, 50-383 Wroclaw, Poland ; Department of Philosophy, Stockholm University, 10-691 Stockholm, Sweden.
authors.forename: Antti
authors.initials: A
authors.lastname: Kuusisto
keywords: Dependence logic; Game-theoretic semantics; Generalized quantifiers; Team semantics