A sufficient condition for first order non-definability of arrowing problems
classification
💻 cs.CC
cs.DMmath.CO
keywords
arrowingconditionfinitefirstknownorderproblemssufficient
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.