Formula (mathematical logic)
From Wikipedia, the free encyclopedia
In mathematical logic, a formula is a formal syntactic object that expresses a proposition, except that the proposition may depend on the values of the free variables of the formula.
The exact definition of a formula depends on the particular development of formal logic in question, but a fairly typical one (specific to first-order logic) goes as follows: Formulas are defined relative to a particular language; that is, a collection of constant symbols, function symbols, 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
- A variable,
- A constant symbol, or
- f(t1,...,tn), where f is an n-ary function symbol, and t1,...,tn are terms.
Finally, a formula is defined recursively as
- t1=t2, where t1 and t2 are terms, or
- R(t1,...,tn), where R is an n-ary relation symbol, and t1,...,tn are terms, or
- (¬φ), where φ is a formula, or
- (φ∧ψ), where φ and ψ are formulas, or
- (∃x)(φ), where x is a variable and φ is a formula.
The first two cases are called atomic formulas.
[edit] See also
[edit] References
Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-568-81262-0.
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
