Let be a formal language, built up by the usual operations of the first order predicate calculus from a stock of (completely defined) primitive predicates, and adequate to discuss its own syntax (perhaps using arithmetization).