We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that such communication is feasible provided the goals of the communicating players are verifiable and compatible. In a previous work we gave supporting evidence for one specific goal -- where one of the players wished to solve a hard computational problem and communicated with the other in the hope of finding a solution. In this work we initiate a "generic" study of the goals of communication. We present two definitions: one of a "generic" meta-goal, which captures the (potentially unrealizable) wishes of communicating agents, and the other being a "generic" syntactic goal, which captures effects that can observed by an agent. We then show, under some technical conditions, that those metagoals that have corresponding syntactic versions are also universally achievable, i.e., achievable ...