Revision as of 00:56, 10 April 2007 editCBM (talk | contribs)Extended confirmed users, File movers, Pending changes reviewers, Rollbackers55,390 edits Remove unenclcylopedic, signed comments from article. Undid revision 121565082 by Laymanal (talk)← Previous edit | Revision as of 04:37, 18 June 2007 edit undo201.55.113.211 (talk)No edit summaryNext edit → | ||
Line 35: | Line 35: | ||
] | ] | ||
] | ] | ||
] |
Revision as of 04:37, 18 June 2007
For the New Zealand government policy, see Working for Families.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.
In formal logic, proofs are sequences of WFFs with certain properties, and the final WFF in the sequence is what is proven.
Examples
For example, in propositional logic the sequence of symbols
is a WFF because it is grammatically correct. The sequence of symbols
is not a WFF, because it does not conform to the grammar of propositional calculus.
Trivia
WFF is the basis for an esoteric pun used in the name of a game product: "WFF 'N PROOF: The Game of Modern Logic," by Layman Allen, developed while he was at Yale Law School (he was later a professor at the University of Michigan). The suite of games is designed to teach the principles of symbolic logic to children (in Polish notation). Its name is an accepted pun on whiffenpoof, a nonsense word used as a cheer at Yale University made popular in The Whiffenpoof Song and The Whiffenpoofs.
Notes
- More technically, propositional logic using the Fitch-style calculus.
See also
External links
- Well-Formed Formula for First Order Predicate Logic - includes a short Java quiz.
- Well-Formed Formula at ProvenMath