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 21:21, 19 August 2007 editDessources (talk | contribs)Extended confirmed users1,277 edits →Trivia: Fixed reference format← Previous edit Revision as of 21:23, 19 August 2007 edit undoDessources (talk | contribs)Extended confirmed users1,277 edits →ExampleNext edit →
Line 9: Line 9:
The well-formed formulae of the ] <math>\mathcal{L}</math> are defined by the following formal grammar, written in ]: The well-formed formulae of the ] <math>\mathcal{L}</math> are defined by the following formal grammar, written in ]:


:<alpha set> ::= p | q | r | s | t | u | ... (a finite set of ]) :<alpha set> ::= p | q | r | s | t | u | ... (arbitrary finite set of ])
:<wff> ::= <alpha set> | <math>\neg</math><wff> | (<wff><math>\wedge</math><wff>) | (<wff><math>\vee</math><wff>) | (<wff><math>\rightarrow</math><wff>) | (<wff><math>\leftrightarrow</math><wff>) :<wff> ::= <alpha set> | <math>\neg</math><wff> | (<wff><math>\wedge</math><wff>) | (<wff><math>\vee</math><wff>) | (<wff><math>\rightarrow</math><wff>) | (<wff><math>\leftrightarrow</math><wff>)


Revision as of 21:23, 19 August 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 L {\displaystyle {\mathcal {L}}} 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> | ¬ {\displaystyle \neg } <wff> | (<wff> ∧ {\displaystyle \wedge } <wff>) | (<wff> ∨ {\displaystyle \vee } <wff>) | (<wff> → {\displaystyle \rightarrow } <wff>) | (<wff> ↔ {\displaystyle \leftrightarrow } <wff>)

The sequence of symbols

(((p → {\displaystyle \rightarrow } q) ∧ {\displaystyle \wedge } (r → {\displaystyle \rightarrow } s)) ∧ {\displaystyle \wedge } ( ¬ {\displaystyle \neg } q ∨ {\displaystyle \vee } ¬ {\displaystyle \neg } s))

is a WFF because it is grammatically correct. The sequence of symbols

((p → {\displaystyle \rightarrow } q) → {\displaystyle \rightarrow } (qq))p))

is not a WFF, because it does not conform to the grammar of L {\displaystyle {\mathcal {L}}} .

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

  1. 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)
  2. More technically, propositional logic using the Fitch-style calculus.

See also

External links

Category: