Well-formed formula
Syntactically correct logical formula / From Wikipedia, the free encyclopedia
For broader coverage of this topic, see Mathematical formula.
In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language.[1]
The abbreviation wff is pronounced "woof", or sometimes "wiff", "weff", or "whiff". [12]
A formal language can be identified with the set of formulas in the language. A formula is a syntactic object that can be given a semantic meaning by means of an interpretation. Two key uses of formulas are in propositional logic and predicate logic.