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, constructed following the defined grammar of a formal language. The abbreviation wff is pronounced "woof", or sometimes "wiff", "weff", or "whiff".
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, constructed following the defined grammar of a formal language. The abbreviation wff is pronounced "woof", or sometimes "wiff", "weff", or "whiff".
Source: Wikipedia "Well-formed formula" · CC BY-SA 4.0
Share this article: X · Bluesky