A sufficient condition for first order non-definability of arrowing problems
Computational Complexity
2012-09-06 v1 Discrete Mathematics
Combinatorics
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.
Keywords
Cite
@article{arxiv.1209.0802,
title = {A sufficient condition for first order non-definability of arrowing problems},
author = {Nerio Borges},
journal= {arXiv preprint arXiv:1209.0802},
year = {2012}
}