Formula (mathematical logic)
Encyclopedia
|
| Tutorials | Encyclopedia | Dictionary | Directory |
|
Formula (mathematical logic)
In mathematical logic, a formula is a type of abstract object a token of which is a symbol or string of symbols which may be interpreted as any meaningful unit (i.e. a name, an adjective, a proposition, a phrase, a string of names, a string of phrases, etcetera) in a formal language. Two different strings of symbols may be tokens of the same formula. It is not necessary for the existence of a formula that there be any tokens of it. The exact definition of a formula depends on the particular formal language in question.[1] A fairly typical definition (specific to first-order logic) goes as follows: Formulas are defined relative to a particular formal language and relation symbols, where each of the function and relation symbols comes supplied with an arity that indicates the number of arguments it takes. Then a term is defined recursively as
An atomic formula is one of the form:
Finally, the set of formulae is defined to be the smallest set containing the set of atomic formulae such that the following holds:
If a formula has no occurrences of \exists x or \forall x, for any variable \ x, then it is called quantifier-free. An existential formula is a string of existential quantification followed by a quantifier-free formula. See alsoReferencesca:Fórmula cs:Formule (logika) es:Fórmula matemática fr:Formule (logique mathématique) ja:??? pl:Formu?a logiczna pt:Fórmula (lógica) ru:?????? ??????? zh:?? (????) Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article
|
|
top
©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement