A simple combinatorial proof for small model property of two-variable logic

Abstract

We present another proof for the well-known {\em small model property} of two-variable logic. As far as we know, existing proofs of this property rely heavily on model theoretic concepts. In contrast, ours is purely combinatorial and uses only a very simple counting argument, which we find rather intuitive and elegant.