Misplaced Pages

Well-formed formula

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by DavidWBrooks (talk | contribs) at 19:38, 16 December 2003 (add WFF n Proof game ...). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 19:38, 16 December 2003 by DavidWBrooks (talk | contribs) (add WFF n Proof game ...)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In logic, WFF stands for well-formed formula. That is, given a formal grammar to produce strings, the assertion 'string S is a WFF' means just that it really is produced by the grammar.

In mathematics, a WFF is often the basis of a proof - which leads to one of the most esoteric puns ever 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, and its name is a pun on whiffenpoof, a nonsense word used as a cheer at Yale University made popular in The Whiffenpoof Song.