Revision as of 12:35, 21 August 2007 editDessources (talk | contribs)Extended confirmed users1,277 editsm →Example← Previous edit | Revision as of 18:04, 16 September 2007 edit undo206.196.48.143 (talk) Prof. Allen stated emphatically in the introduction to the 1965 edition of the WFF 'n PROOF rule book that this was not the case.Next edit → | ||
Line 23: | Line 23: | ||
==Trivia== | ==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<ref>{{cite news | first=Rachel | last=Ehrenberg | coauthors= | title=He's Positively Logical | date=Spring 2002 | publisher=University of Michigan | url=http://www.umich.edu/~newsinfo/MT/02/Spr02/mt9s02.html | work=Michigan Today | pages= | accessdate=2007-08-19 | language = }}</ref>, developed while he was at ] (he was later a professor at the ]). The suite of games is designed to teach the principles of symbolic logic to children (in ])<ref>More technically, ] using the ].</ref>. Its name is an accepted pun on '']'', a nonsense word used as a ] at ] made popular in ''The Whiffenpoof Song'' and ]. | ''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<ref>{{cite news | first=Rachel | last=Ehrenberg | coauthors= | title=He's Positively Logical | date=Spring 2002 | publisher=University of Michigan | url=http://www.umich.edu/~newsinfo/MT/02/Spr02/mt9s02.html | work=Michigan Today | pages= | accessdate=2007-08-19 | language = }}</ref>, developed while he was at ] (he was later a professor at the ]). The suite of games is designed to teach the principles of symbolic logic to children (in ])<ref>More technically, ] using the ].</ref>. Its name is an accepted pun on '']'',{{Fact|date=September 2007}} a nonsense word used as a ] at ] made popular in ''The Whiffenpoof Song'' and ]. | ||
==Notes== | ==Notes== |
Revision as of 18:04, 16 September 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.
Example
The well-formed formulae of the propositional calculus are defined by the following formal grammar, written in BNF:
- <alpha set> ::= p | q | r | s | t | u | ... (arbitrary finite set of propositional variables)
- <wff> ::= <alpha set> | <wff> | (<wff><wff>) | (<wff><wff>) | (<wff><wff>) | (<wff><wff>)
The sequence of symbols
- (((p q) (r s)) (q s))
is a WFF because it is grammatically correct. The sequence of symbols
- ((p q)(qq))p))
is not a WFF, because it does not conform to the grammar of .
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
- Ehrenberg, Rachel (Spring 2002). "He's Positively Logical". Michigan Today. University of Michigan. Retrieved 2007-08-19.
{{cite news}}
: Cite has empty unknown parameter:|coauthors=
(help) - 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