- Formula (mathematical logic)
mathematical logic, a formula is a type of abstract objecta token of which is a symbolor 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. [Hunter, Geoffrey, Metalogic: An Introduction to the Metatheory of Standard First-Order Logic]
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 aritythat indicates the number of arguments it takes.
Then a term is defined recursively as
#A constant, or
#"f"("t"1,...,"t""n"), where "f" is an "n"-ary function symbol, and "t"1,...,"t""n" are terms.
atomic formulais one of the form:
#"t"1="t"2, where "t"1 and "t"2 are terms, or
#"R"("t"1,...,"t""n"), where "R" is an "n"-ary relation symbol, and "t"1,...,"t""n" are terms.
Finally, the set of formulae is defined to be the smallest set containing the set of atomic formulae such that the following holds:
# is a formula when is a formula;
# and are formulae when and are formulae;
# is a formula when "x" is a variable and is a formula;
# is a formula when is a variable and is a formula (alternatively, could be defined as an abbreviation for ).
If a formula has no occurrences of or , for any variable , then it is called "quantifier-free". An "existential formula" is a string of existential quantification followed by a quantifier-free formula.
*cite book | author = Hinman, P. | title = Fundamentals of Mathematical Logic | publisher = A K Peters | year = 2005 | id = ISBN 1-568-81262-0
Wikimedia Foundation. 2010.