Alternatively, if does not contain a name for each object, we can extend to by adding a binary satisfaction predicate Sat(s,x) where ranges over finite sequences of elements of and ranges over formulas.