General algebraic systems Terms, identities and equational logic Concept
Inherently nonfinitely based algebra
Summary
A finite algebra is inherently nonfinitely based when no locally finite variety that contains it is finitely based. This is a strong and robust way of failing to be finitely based: it passes to every finite algebra whose variety contains the given one. It gives a convenient tool to show that many finite algebras, such as some finite semigroups, are not finitely based.
Further reading
About this page
| Tag | Z6TKYRZ9WX |
|---|---|
| URI | m2://Z6TKYRZ9WX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 08B05 |
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.