Given a Language and a -Structure , we define ” is true in ” or: for a formula , recursively on . Crucial step is: if and only if for some : Theorem (Tarski) There is no formula saying something is true.