Math 2.0

Mathematical logic and foundations Definition

Well-formed formula

Builds on SignatureTermLogical connective

Definition

Let σ\sigma be a signature and VV a set of variables. The set of first-order formulas over σ\sigma is the smallest set of strings such that:

  1. if t1t_1 and t2t_2 are terms, then t1=t2t_1 = t_2 is a formula;
  2. if RR is a relation symbol of arity nn and t1,…,tnt_1, \dots, t_n are terms, then R(t1,…,tn)R(t_1, \dots, t_n) is a formula;
  3. if φ\varphi and ψ\psi are formulas, then ¬φ\neg \varphi, (φ∧ψ)(\varphi \land \psi), (φ∨ψ)(\varphi \lor \psi), (φ→ψ)(\varphi \to \psi) and (φ↔ψ)(\varphi \leftrightarrow \psi) are formulas;
  4. if φ\varphi is a formula and x∈Vx \in V, then ∀x φ\forall x \, \varphi and ∃x φ\exists x \, \varphi are formulas.

The formulas from clauses 1 and 2 are the atomic formulas.

Remarks

In the signature of ordered sets, ∀x ∃y (x<y)\forall x \, \exists y \, (x < y) is a formula. Here x<yx < y is atomic by clause 2, ∃y (x<y)\exists y \, (x < y) follows by clause 4, and then ∀x\forall x by clause 4 again. The string ∀x (x∧y)\forall x \, (x \land y) is not a formula: xx and yy 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Logical connective concept
  2. Signature concept
  3. Term concept
  4. Well-formed formula definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Well-formed_formula
About this page
Tag2CHENV4DCC
URIm2://2CHENV4DCC
Kinddefinition
WritingW0 stub
MSC03B10, 03B05
DefinesWell-formed formula
UsesSignature, Term, Logical connective
Changed2 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.