The set T of terms is defined recursively by the following rules.

The following example shows how a pipeline of processes can be recursively defined using a statement.

This predicate is defined recursively in Lines 4 and 5.

Addition and multiplication are recursively defined by means of successor.

Then we recursively define the truth of a formula in a model:

A nice feature of this meld operation is that it can be defined recursively.

First, the set of terms is defined recursively.

The canonical example of a recursively defined set is given by the natural numbers:

In this article, we first describe a formalism for defining recursively.

Recursively defined mathematical objects include functions, sets, and especially fractals.