{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "H408H4WHBA"
    }
  ],
  "body": "\n## Summary\n\nLinear logic, introduced by Jean-Yves Girard in 1987, is a logic in which hypotheses are resources that must be used exactly once.\nIt drops the structural rules of weakening and contraction, and allows them back only for formulas marked with the exponentials $!$ and $?$.\nAs a result, conjunction and disjunction split into multiplicative and additive versions.\nIt has applications in proof theory, the semantics of programming languages and the theory of concurrency.\n\n## Explanations\n\n### L1 human\n\nIn ordinary logic, a hypothesis can be used as often as you like, or not at all.\nIn linear logic, using a hypothesis consumes it, like spending a coin.\nWith one euro you can buy a coffee, and with one euro you can buy a tea, but one euro does not buy both.\nLinear logic has a separate connective for each of these situations: \"I can choose either\" and \"I have both at once\".\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "03B47",
      "03F52"
    ],
    "name": "Linear logic",
    "same_as": {
      "wikidata": "Q841728",
      "wikipedia": "Linear logic"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Linear_logic"
      }
    ],
    "tag": "2P2184B6HE"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/2P2184B6HE/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2P2184B6HE.md",
  "msc": [
    "03B47",
    "03F52"
  ],
  "name": "Linear logic",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2P2/2P2184B6HE.md",
  "status": null,
  "tag": "2P2184B6HE",
  "uri": "m2://2P2184B6HE",
  "url": "https://math2.tamnd.com/wiki/linear-logic/",
  "writing": {
    "tag": "2P2184B6HE",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}