{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "DJEK11CXXJ"
    },
    {
      "field": "uses",
      "target": "T440VB9JJM"
    },
    {
      "field": "specializes",
      "target": "XD01Y7B6XW"
    }
  ],
  "body": "\n## Summary\n\nA quasi-primal algebra is a finite algebra in which the [[ternary discriminator|72PG6XCQ7D]] is a term operation.\nEvery primal algebra is quasi-primal, and so is every finite field.\nThe variety generated by a quasi-primal algebra is a [[discriminator variety|MC9MX40Z7S]], so it is arithmetical and well understood.\nQuasi-primal algebras are a natural middle ground between primal algebras and arbitrary finite algebras.\n\n## Explanations\n\n### L1 human\n\nIn a quasi-primal algebra, the operations can test whether two elements are equal and act on the answer.\nThis is weaker than expressing every function, as in a primal algebra.\nFor example, the field with four elements can express the test, but it cannot express a constant that is moved by its Frobenius automorphism.\nSuch algebras still behave much like Boolean algebras in many structural questions.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "08A40",
      "08B05"
    ],
    "name": "Quasi-primal algebra",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Functional_completeness"
      }
    ],
    "tag": "QWSBDFM47K"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/QWSBDFM47K/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/QWSBDFM47K.md",
  "msc": [
    "08A40",
    "08B05"
  ],
  "name": "Quasi-primal algebra",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/QWS/QWSBDFM47K.md",
  "status": null,
  "tag": "QWSBDFM47K",
  "uri": "m2://QWSBDFM47K",
  "url": "https://tamnd.github.io/math2/wiki/quasi-primal-algebra/",
  "writing": {
    "tag": "QWSBDFM47K",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}