{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nMinimization (simplification) of combinational logic formulas is done using the following rules based on the laws of Boolean algebra:\n\n$$\\begin{aligned} (A \\vee B) \\wedge (A \\vee C) \u0026= A \\vee (B \\wedge C) \\\\ (A \\wedge B) \\vee (A \\wedge C) \u0026= A \\wedge (B \\vee C) \\end{aligned}$$\n\n$$\\begin{aligned} A \\vee (A \\wedge B) \u0026= A \\\\ A \\wedge (A \\vee B) \u0026= A \\end{aligned}$$\n\n$$\\begin{aligned} A \\vee (\\lnot A \\wedge B) \u0026= A \\vee B \\\\ A \\wedge(\\lnot A \\vee B) \u0026= A \\wedge B \\end{aligned}$$\n\n$$\\begin{aligned} (A \\vee B)\\wedge(\\lnot A \\vee B)\u0026=B \\\\ (A \\wedge B) \\vee (\\lnot A \\wedge B)\u0026=B \\end{aligned}$$\n\n$$\\begin{aligned} (A \\wedge B) \\vee (\\lnot A \\wedge C) \\vee (B \\wedge C) \u0026= (A \\wedge B) \\vee (\\lnot A \\wedge C) \\\\ (A \\vee B) \\wedge (\\lnot A \\vee C) \\wedge (B \\vee C) \u0026= (A \\vee B) \\wedge (\\lnot A \\vee C) \\end{aligned}$$\n\nWith the use of minimization (sometimes called logic optimization), a simplified logical function or circuit may be arrived upon, and the logic combinational circuit becomes smaller, and easier to analyse, use, or build.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "9DJTNX062G"
    ],
    "kind": "statement",
    "name": "Logic formula minimization",
    "role": "proposition",
    "sources": [
      {
        "locator": "Combinational logic, section Logic formula minimization",
        "mention": "wikipedia://en/89371#JJNT",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:89371@r1365055466"
      }
    ],
    "tag": "2A7JZAYKR8"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/2A7JZAYKR8/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2A7JZAYKR8.md",
  "msc": null,
  "name": "Logic formula minimization",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2A7/2A7JZAYKR8.md",
  "status": null,
  "tag": "2A7JZAYKR8",
  "uri": "m2://2A7JZAYKR8",
  "url": "https://math2.tamnd.com/wiki/logic-formula-minimization/",
  "writing": {
    "tag": "2A7JZAYKR8",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}