{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematical logic and graph theory, an **implication graph** is a skew-symmetric, [[directed graph|0KFYGSHHF5]] $G = (V, E)$ composed of vertex set $V$ and directed edge set $E$. Each vertex in $V$ represents the truth status of a Boolean literal, and each directed edge from vertex $u$ to vertex $v$ represents the [[material implication|0NMG7W7Q11]] \"If the literal $u$ is true then the literal $v$ is also true\". Implication graphs were originally used for analyzing complex Boolean expressions.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "VF4QQQ1XDW"
    ],
    "kind": "concept",
    "name": "Implication graph",
    "same_as": {
      "wikidata": "Q17098063",
      "wikipedia": "Implication graph"
    },
    "sources": [
      {
        "locator": "Implication graph",
        "mention": "wikipedia://en/9419642",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:9419642@r1344282808"
      }
    ],
    "tag": "Z1BRWWR5QR"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/Z1BRWWR5QR/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/Z1BRWWR5QR.md",
  "msc": null,
  "name": "Implication graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/Z1B/Z1BRWWR5QR.md",
  "status": null,
  "tag": "Z1BRWWR5QR",
  "uri": "m2://Z1BRWWR5QR",
  "url": "https://math2.tamnd.com/wiki/implication-graph/",
  "writing": {
    "tag": "Z1BRWWR5QR",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}
