{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Definition\n\nLet $n$ be a natural number.\nA Boolean function of $n$ variables is a function $f : \\{0, 1\\}^n \\to \\{0, 1\\}$.\n\n## Remarks\n\nThere are $2^n$ inputs, so there are $2^{2^n}$ Boolean functions of $n$ variables.\nA truth table lists the values of a Boolean function on all inputs.\nEvery Boolean function is given by a formula in [[disjunctive normal form|06S4WGSEQA]], and also by one in [[conjunctive normal form|07C4A8Y18K]].\n\n## Explanations\n\n### L1 human\n\nA Boolean function takes some bits as input and returns one bit.\nThe logic gates and, or and not are Boolean functions, and a digital circuit computes a Boolean function.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "defines": "0X05GS525E",
    "kind": "definition",
    "msc": [
      "06E30",
      "94C11"
    ],
    "name": "Boolean function",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Boolean_function"
      }
    ],
    "tag": "0A58THH5XV"
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0A58THH5XV/",
  "links": [
    {
      "field": "defines",
      "target": "0X05GS525E"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0A58THH5XV.md",
  "msc": [
    "06E30",
    "94C11"
  ],
  "name": "Boolean function",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0A5/0A58THH5XV.md",
  "status": null,
  "tag": "0A58THH5XV",
  "uri": "m2://0A58THH5XV",
  "url": "https://math2.tamnd.com/wiki/boolean-function-definition/",
  "writing": {
    "tag": "0A58THH5XV",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}