Misplaced Pages

Well-formed formula

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.

This is an old revision of this page, as edited by Charles Matthews (talk | contribs) at 19:14, 16 December 2003 (Initial page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 19:14, 16 December 2003 by Charles Matthews (talk | contribs) (Initial page)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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