Mathematical logic and foundations Definition
Well-formed formula
Builds on SignatureTermLogical connective
Definition
Let be a signature and a set of variables. The set of first-order formulas over is the smallest set of strings such that:
- if and are terms, then is a formula;
- if is a relation symbol of arity and are terms, then is a formula;
- if and are formulas, then , , , and are formulas;
- if is a formula and , then and are formulas.
The formulas from clauses 1 and 2 are the atomic formulas.
Remarks
In the signature of ordered sets, is a formula.
Here is atomic by clause 2, follows by clause 4, and then by clause 4 again.
The string is not a formula: and are terms, not formulas, so clause 3 does not apply to them.
In propositional logic the formulas are built from variables by clause 3 alone.
The connectives used vary between books, since some are definable from others.
In Mathlib formulas with bounded variables are FirstOrder.Language.BoundedFormula.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Logical connective concept
- Signature concept
- Term concept
- Well-formed formula definition
Further reading
About this page
| Tag | 2CHENV4DCC |
|---|---|
| URI | m2://2CHENV4DCC |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03B10, 03B05 |
| Defines | Well-formed formula |
| Uses | Signature, Term, Logical connective |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.