  But even if expressions like “a ‘color’-inscription” did not contain singular terms, Goodman's suggestion that whatever is true of the type is true of all the tokens has two fatal defects. First, it would turn truths into falsehoods. ‘Paris’ consists of five letters, as does ‘color’, but not every ‘color’-inscription consists of just five letter-inscriptions since some are spelled ‘c’-‘o’-‘l’-‘o’-‘u’-‘r’. (As for denying that these are inscriptions of the word ‘color’ see “Orthography” in §4 above.) It doesn't even work for the word ‘Paris’, as it has the forms ‘Pareiss’ and ‘Parrys’ also. Second, Goodman's technique of replacing singular terms by predicates only works if we are employing a realist semantics. That is, the key to his program is that for every word in the dictionary and every sentence in the language there corresponds a unique predicate that is true of just the tokens of that word/that sentence. (Without such predicates, true statements apparently referring to types would be short for nothing at all.) But this is only plausible on a realist semantics. If ‘predicate’ meant ‘predicate token’ there would not even be enough predicates for every word in the dictionary, much less every sentence in the language. That is, it is certainly false that for every word α in the dictionary, there is an actual predicate token of the form ‘is an α-inscription’.  For more details on the problems with Goodman's strategy, see Wetzel (2000).