First-Order Dialogical Games and Tableaux

We present a new proof of soundness/completeness of tableaux with respect to dialogical games in Classical First-Order Logic. As far as we know it is the first thorough result for dialogical games where finiteness of plays is guaranteed by means of what we call repetition ranks.