It is shown that the logical truth of instances of the T-schema is incompatible with the formal nature of logical truth. In particular, since the formality of logical truth entails that the set of logical truths is closed under substitution, the logical truth of T-schema instances entails that all sentences are logical truths.