A sufficient condition for first order non-definability of arrowing problems
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
