Question: what is wff in discrete mathematics?
Answer: 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. ... Two key uses of formulas are in propositional logic and predicate logic.