General algebraic systems Clones and operations Concept
Primal algebra
Summary
A primal algebra is a finite algebra in which every finitary operation on its universe is a term operation. Equivalently, its basic operations form a functionally complete set. The two-element Boolean algebra and the rings for a prime are primal. By Foster's theorem, the variety generated by a primal algebra looks just like the variety of Boolean algebras.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | XD01Y7B6XW |
|---|---|
| URI | m2://XD01Y7B6XW |
| Kind | concept |
| Writing | W0 stub |
| MSC | 08A40 |
| Specializes | Quasi-primal algebra |
| 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.