 Tarski does not merely propose a condition of adequacy for theories of truth, he also shows how to meet it. One of his insights is that if the language \(\mathbf{L}\) displays the right structure, then truth for \(\mathbf{L}\) can be defined recursively. For instance, let us suppose that \(\mathbf{L}\) is a simple formal language, containing two atomic sentences ‘snow is white’ and ‘grass is green’, and the sentential connectives \(\vee\) and \(\neg\).