For a formula in a recursively constructed language , any formula an instance of which is employed in the inductive definition of , including itself. For example, in a language with a binary connective , one may have a clause:
In this case, not only are and subformulae of , but the subformulae of and themselves, appearing in the recursive construction of , are subformulae of .