Then it is easy to prove by induction that each predicate Tn(x) is totally defined, that the extension of (x) consists precisely of the true formulas of, while that of Tn+ (x) consists of the true formulas of the language obtained by adjoining Tn(x) to.