 Various Löwenheim-Skolem Theorems of model theory can be proved using variants of the Forcing Game. In these variants we do not construct a model but a submodel of a given model. We start with a big model \(M\) for a sentence (or a countable set of sentences) \(\phi\). Then we list the subformulas of \(\phi\) and each player has a subformula with a free variable to attend to. The player’s task is to make sure that as soon as the parameters of the subformula occur in the game, and there is a witness to the truth of the formula in the big model, one such a witness is played. When the game is over, a countable submodel of \(M\) has been built in such a way that it satisfies \(\phi\).