Tarski's Undefinability Theorem
Definition
A formal result that no sufficiently expressive formal language (for example, one that can represent basic arithmetic) can contain a formula that correctly and uniformly defines the truth predicate for sentences of that same language.