3
Trachtenbrot’s Theorem
•Definition. f is finitely satisfiable if there exists a finite model A s.t. A ² f
•
•Theorem [Trakhtenbrot] Suppose s has at least one relation symbol of arity ¸ 2.  Then it is undecidable whether a sentence f is finitely satisfiable.