This is an old revision of this page, as edited by 216.67.203.105 (talk) at 05:52, 17 December 2003 (Less opinionated). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 05:52, 17 December 2003 by 216.67.203.105 (talk) (Less opinionated)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)In logic, WFF is an abbreviation for well-formed formula. That is, given a formal grammar to produce strings, the assertion 'string S is a WFF' only means 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 notoriously 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 (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.