  We here present a sufficient condition for general arrowing problems to be
non definable in first order logic, based in well known tools of finite model
theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like
senders and determiners.
