Math 2.0

General algebraic systems Clones and operations Concept

Quasi-primal algebra

Summary

A quasi-primal algebra is a finite algebra in which the ternary discriminator is a term operation. Every primal algebra is quasi-primal, and so is every finite field. The variety generated by a quasi-primal algebra is a discriminator variety, so it is arithmetical and well understood. Quasi-primal algebras are a natural middle ground between primal algebras and arbitrary finite algebras.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Functional_completeness
About this page
TagQWSBDFM47K
URIm2://QWSBDFM47K
Kindconcept
WritingW0 stub
MSC08A40, 08B05
Changed2 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.

What links here

Definitions

Used by

Special cases