Аннотация:We prove completeness for some normal modal predicate logics in the standard Kripke
semantics with expanding domains. We consider quantified versions of propositional
logics with the axiom of density plus some others (transitivity, confluence).
The method of proof modifies the technique developed for other cases (without density) by S. Ghilardi, G. Corsi and D. Skvorstov; but now we arrange the whole construction in a game-theoretic style.