Difference between revisions of "Well-formed formula"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In mathematical logic, a '''well-formed formula''', abbreviated '''wff''', often simply '''formula''', is a finite sequence of symbols from a given A...") |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 19: | Line 19: | ||
* [https://en.wikipedia.org/wiki/Well-formed_formula Well-formed formula] @ Wikipedia.org | * [https://en.wikipedia.org/wiki/Well-formed_formula Well-formed formula] @ Wikipedia.org | ||
| − | + | ||
[[Category:Logic]] | [[Category:Logic]] | ||
[[Category:Mathematics]] | [[Category:Mathematics]] | ||
Latest revision as of 14:04, 3 September 2016
In mathematical logic, a well-formed formula, abbreviated wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language.
A formal language can be identified with the set of formulas in the language.
A formula is a syntactic object that can be given a semantic meaning by means of an interpretation.
Two key uses of formulas are in propositional logic and predicate logic.
See also
External links
- Well-formed formula @ Wikipedia.org
