Misplaced Pages

Well-formed formula: Difference between revisions

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.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 16:25, 27 July 2006 editMichael Hardy (talk | contribs)Administrators210,279 editsmNo edit summary← Previous edit Revision as of 23:33, 8 August 2006 edit undoIhope127 (talk | contribs)1,080 editsm Put pronunciation right after the first mention of "WFF"Next edit →
Line 1: Line 1:
{{dablink|For the ] government policy, see ].}} {{dablink|For the ] government policy, see ].}}


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''' (pronounced "wiff") is an abbreviation for '''well-formed formula'''. Given a ], a WFF is any string that is generated by that grammar.


For example, in ] the sequence of symbols <math>((\alpha\rightarrow\beta)\rightarrow(\neg\beta\rightarrow\neg\alpha))</math> is a WFF because it is grammatically correct. The sequence of symbols <math>((\alpha\rightarrow\beta)\rightarrow(\beta\beta))\alpha))</math> is not a WFF, because it does not conform to the grammar of propositional calculus. For example, in ] the sequence of symbols <math>((\alpha\rightarrow\beta)\rightarrow(\neg\beta\rightarrow\neg\alpha))</math> is a WFF because it is grammatically correct. The sequence of symbols <math>((\alpha\rightarrow\beta)\rightarrow(\beta\beta))\alpha))</math> is not a WFF, because it does not conform to the grammar of propositional calculus.

Revision as of 23:33, 8 August 2006

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.

For example, in propositional logic the sequence of symbols ( ( α → β ) → ( ¬ β → ¬ α ) ) {\displaystyle ((\alpha \rightarrow \beta )\rightarrow (\neg \beta \rightarrow \neg \alpha ))} is a WFF because it is grammatically correct. The sequence of symbols ( ( α → β ) → ( β β ) ) α ) ) {\displaystyle ((\alpha \rightarrow \beta )\rightarrow (\beta \beta ))\alpha ))} 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

Category: