Misplaced Pages

This is an old revision of this page, as edited by Ihope127 (talk | contribs) at 23:33, 8 August 2006 (Put pronunciation right after the first mention of "WFF"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In logic, WFF (pronounced "wiff") is an abbreviation for well-formed formula. Given a formal grammar, a WFF is any string that is generated by that grammar.

For example, in propositional logic the sequence of symbols ${\displaystyle ((\alpha \rightarrow \beta )\rightarrow (\neg \beta \rightarrow \neg \alpha ))}$ is a WFF because it is grammatically correct. The sequence of symbols ${\displaystyle ((\alpha \rightarrow \beta )\rightarrow (\beta \beta ))\alpha ))}$ is not a WFF, because it does not conform to the grammar of propositional calculus.

In formal logic, proofs are sequences of WFFs with certain properties, and the final WFF in the sequence is what is proven. This is the basis for an esoteric pun used in the name of a product: "WFF 'n Proof: The Game of Modern Logic," by Layman Allen, a professor at the University of Michigan. The board game is designed to teach the principles of symbolic logic to children (in Polish notation), and its name is a pun on whiffenpoof, a nonsense word used as a cheer at Yale University made popular in The Whiffenpoof Song.

See also

• Formula (mathematical logic)

External links

• Well-Formed Formula for First Order Predicate Logic - includes a short Java quiz.
• Well-Formed Formula at ProvenMath

• Logic