22
Gaifman’s Theorem
•Theorem [Gaifman] Let s be relational.  Then every FO sentence over s is equivalent to a Boolean combination of sentences of the form:
9 x1 … 9 xs(Æi=1,sa(r)(xi)) Æ (Æ1 · i < j · s d>2r(xi, xj))