 However, this principle is false. The simplest counterexample to it, Resnick points out, is Tarskian truth. Suppose we impose on \(T\)’s model \(M\) a condition \(f^*\) that \(M\) makes all of \(T\)’s theses come out true. Then, unless \(T\) is either inconsistent or too weak to express elementary arithmetic no truth predicate will be definable in \(T\). Whence there will be no condition \(C\) expressible in \(T\) corresponding to this condition \(f^*\) on \(T\)’s model(s) \(M\).