{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, a **residuated Boolean algebra** is a residuated lattice whose lattice structure is that of a [[Boolean algebra|0XADJKM699]]. Examples include Boolean algebras with the [[monoid|0N6R902FG1]] taken to be conjunction, the set of all formal languages over a given alphabet $\\Sigma$ under concatenation, the set of all [[binary relations|05AVARPXA2]] on a given set $X$ under relational composition, and more generally the [[power set|00E0YZCERH]] of any [[equivalence relation|0G8VEZ3WTK]], again under relational composition. The original application was to relation algebras as a finitely axiomatized generalization of the binary relation example, but there exist interesting examples of residuated Boolean algebras that are not relation algebras, such as the language example.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "W4FV457732"
    ],
    "kind": "concept",
    "name": "Residuated Boolean algebra",
    "same_as": {
      "wikidata": "Q7315522",
      "wikipedia": "Residuated Boolean algebra"
    },
    "sources": [
      {
        "locator": "Residuated Boolean algebra",
        "mention": "wikipedia://en/12435391",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:12435391@r1352956591"
      }
    ],
    "tag": "KCG48CWY69"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/KCG48CWY69/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/KCG48CWY69.md",
  "msc": null,
  "name": "Residuated Boolean algebra",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/KCG/KCG48CWY69.md",
  "status": null,
  "tag": "KCG48CWY69",
  "uri": "m2://KCG48CWY69",
  "url": "https://math2.tamnd.com/wiki/residuated-boolean-algebra/",
  "writing": {
    "tag": "KCG48CWY69",
    "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
      }
    ]
  }
}
