Mathematical logic and foundations Definition
Substitution
Definition
Let be a signature with only function symbols and let be a set of variables. Let be the set of terms over and . A substitution is a map . Its application to a term , written , is defined by recursion on :
- for each variable ;
- for each constant symbol ;
- for each function symbol of arity .
Remarks
Usually for all but finitely many , and is written . A term is an instance of if for some substitution . The substitutions are exactly the endomorphisms of the term algebra , restricted to the variables. For an identity , the identity holds in every algebra in which holds.
Example: with , clause 3 and clause 1 give .
Non-example: the replacement of the first occurrence of in by is not a substitution. By clauses 1 and 3, every substitution sends to , which never equals .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Signature concept
- Term concept
- Substitution definition
Further reading
About this page
| Tag | XN8TQE6SRK |
|---|---|
| URI | m2://XN8TQE6SRK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03B10, 08B05 |
| Defines | Substitution |
| Uses | Term, Signature |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.