{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "VH4R85Y6Y3"
    },
    {
      "field": "uses",
      "target": "X74S395RZD"
    }
  ],
  "body": "\n## Summary\n\nHuntington's axioms are a short system of axioms for [[Boolean algebras|0XADJKM699]] in terms of one binary operation $+$ and one unary operation $n$.\nBesides commutativity and associativity of $+$, they need only Huntington's equation $n(n(x) + y) + n(n(x) + n(y)) = x$.\nEdward Huntington gave this system in 1933, after an earlier set of postulates from 1904.\nThe question whether Huntington's equation can be replaced by a similar equation of Herbert Robbins became the [[Robbins conjecture|X74S395RZD]].\n\n## Explanations\n\n### L1 human\n\nRead $+$ as \"or\" and $n$ as \"not\".\nThen Huntington's equation says: \"($x$ and not $y$) or ($x$ and $y$)\" is the same as $x$, written with \"or\" and \"not\" only.\nIt is surprising that this single law, together with the rules for reordering and regrouping \"or\", already gives all of Boolean algebra.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "06E05",
      "03G05"
    ],
    "name": "Huntington's axioms",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Boolean_algebra_(structure)"
      }
    ],
    "tag": "M3GFCVX549"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/M3GFCVX549/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/M3GFCVX549.md",
  "msc": [
    "06E05",
    "03G05"
  ],
  "name": "Huntington's axioms",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/M3G/M3GFCVX549.md",
  "status": null,
  "tag": "M3GFCVX549",
  "uri": "m2://M3GFCVX549",
  "url": "https://tamnd.github.io/math2/wiki/huntingtons-axioms/",
  "writing": {
    "tag": "M3GFCVX549",
    "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
      }
    ]
  }
}
