General algebraic systems Terms, identities and equational logic Concept
Term evaluation
Summary
Term evaluation computes the value of a term in an algebra once each variable has been given a value. The value is defined by recursion on the term. Variables take their assigned values, and a function symbol applied to subterms is computed with the matching operation of the algebra. It is the bridge between syntax and algebra: identities, term operations and the free algebras of a variety are all defined through it.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | DH30WTA26T |
|---|---|
| URI | m2://DH30WTA26T |
| Kind | concept |
| Writing | W0 stub |
| MSC | 08A40, 03C07 |
| 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.