View source for Well-formed formula

In [[mathematical logic]], a '''well-formed formula''', abbreviated '''wff''', often simply '''formula''', is a finite sequence of [[Symbol (formal)|symbols]] from a given [[Alphabet (formal languages)|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 [[Syntax (logic)|syntactic]] object that can be given a [[Semantics of logic|semantic meaning]] by means of an interpretation.

Two key uses of formulas are in propositional logic and predicate logic.

== See also ==

* [[Alphabet (formal languages)]]
* [[Ground expression]]
* [[Semantics of logic]]
* [[Symbol (formal)]]
* [[Syntax (logic)]]

== External links ==

* [https://en.wikipedia.org/wiki/Well-formed_formula Well-formed formula] @ Wikipedia.org 


[[Category:Logic]]
[[Category:Mathematics]]