In a recent paper Professor Wesley Salmon1 has shown that a certain class of c-functions, including the c-function c*. described by Rudolph Carnap2 yield incompatible results when applied to the same sentences in two languages systems which, though they have the same individual constants, do not have the same predicates. Each c-function of the class in question is characterized by a parameter λ which is a function of the number of Q-predicates in the language system in which the c-function is used.3 Taking c* as representative of this class of c-functions, I shall argue that Professor Salmon's results do not provide a reasonable basis for rejecting such c-functions in favor of others. More specifically, I shall argue (i) that such c-functions yield incompatible results in two languages because not both of the languages are sufficiently complete, (ii) that for any two languages in which such c-functions yield incompatible results there is a rule that will select either the more complete of the two languages or a language that is more complete than either of the two languages, and (iii) that it is impossible for such c-functions to yield incompatible results in two languages that are equally complete.