  In this paper, we give new proofs of the celebrated Andr\'eka-Resek-Thompson
representability results of certain axiomatized cylindric-like algebras. Such
representability results provide completeness theorems for variants of first
order logic, that can also be viewed as multi-modal logics. The proofs herein
are combinatorial and we also use some techniques from game theory.
