In mathematical logic, a well-forme formula (often abbreviated WFF, pronounced "wiff" or "wuff") is a symbol or string of symbols (a formula) that is generated by the formal grammar of a formal language. To say that a string is a WFF with respect to a given formal grammar is equivalent to saying that belongs to the language generated by , i. e. . A formal language can be identified with the set of its WFFs.