6
Proof of Trakhtenbrot’s Theorem
•By reduction from the halting problem: given a Turing machine M, does it halt on the empty tape ?
•
•Given M, construct fM s.t. M halts iff fM has a finite model