| Revision as of 16:45, 9 May 2006 editJulian Mendez (talk | contribs)Extended confirmed users2,170 editsmNo edit summary← Previous edit | Revision as of 04:24, 18 May 2006 edit undoMidnighttonight (talk | contribs)2,078 edits disam at topNext edit → | ||
| Line 1: | Line 1: | ||
| ''In ], WFF also stands for ]'' | |||
| In ], '''WFF''' is an abbreviation for '''well-formed formula'''. (Pronounced as "wiff") Given a ], a WFF is any string that is generated by that grammar. | In ], '''WFF''' is an abbreviation for '''well-formed formula'''. (Pronounced as "wiff") Given a ], a WFF is any string that is generated by that grammar. | ||
Revision as of 04:24, 18 May 2006
In New Zealand, WFF also stands for Working for Families In logic, WFF is an abbreviation for well-formed formula. (Pronounced as "wiff") Given a formal grammar, a WFF is any string that is generated by that grammar.
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.
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.
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
External links
- Well-Formed Formula for First Order Predicate Logic - includes a short Java quiz.