 The reason why Tarski defines satisfaction directly, and then deduces a definition of truth, is that satisfaction obeys recursive conditions in the following sense: if \(F\) is a compound formula, then to know which assignments satisfy \(F\), it’s enough to know which assignments satisfy the immediate constituents of \(F\). Here are two typical examples: