WFF

In logic, WFF is an abbreviation for well-formed formula. That is, given a formal grammar to produce strings, the assertion 'string S is a WFF' only means that it really is produced by the grammar.

For example, in propositional calculus the sequence of symbols is a WFF because it is grammatically correct (in fact, it is a tautology). The sequence of symbols is not a WFF, because it does not conform to the grammar of propositional calculus.

Informally, WFFs are the sequences of symbols which have meaning in a given logical system.

In mathematics, a WFF is often the basis of a proof, which leads to one of the most notoriously esoteric puns ever 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.

External link


">
" size=20>

 
 

Browse articles alphabetically:
#0">0 | #1">1 | #2">2 | #3">3 | #4">4 | #5">5 | #6">6 | #7">7 | #8">8 | #9">9 | #_">_ | #A">A | #B">B | #C">C | #D">D | #E">E | #F">F | #G">G | #H">H | #I">I | #J">J | #K">K | #L">L | #M">M | #N">N | #O">O | #P">P | #Q">Q | #R">R | #S">S | #T">T | #U">U | #V">V | #W">W | #X">X | #Y">Y | #Z">Z