{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "ETCVR65W3M"
    }
  ],
  "body": "\n## Summary\n\nA paraconsistent logic is a logic in which a contradiction does not imply every statement.\nIn classical and [[intuitionistic logic|Q11N8X99FK]], the principle of explosion derives any $\\psi$ from $\\varphi$ and $\\neg\\varphi$; paraconsistent logics reject it.\nThey allow reasoning with inconsistent information, such as a database with conflicting entries, without collapse.\n\n## Explanations\n\n### L1 human\n\nIn ordinary logic, one contradiction ruins everything: from \"$p$\" and \"not $p$\" you can prove anything at all.\nA paraconsistent logic blocks this, so a contradiction stays local.\nSuppose a database says both \"the train leaves at 9\" and \"the train does not leave at 9\".\nIt should not let you conclude that the moon is made of cheese.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "03B53"
    ],
    "name": "Paraconsistent logic",
    "same_as": {
      "wikidata": "Q426592",
      "wikipedia": "Paraconsistent logic"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Paraconsistent_logic"
      }
    ],
    "tag": "C7YWCR87QJ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/C7YWCR87QJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/C7YWCR87QJ.md",
  "msc": [
    "03B53"
  ],
  "name": "Paraconsistent logic",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/C7Y/C7YWCR87QJ.md",
  "status": null,
  "tag": "C7YWCR87QJ",
  "uri": "m2://C7YWCR87QJ",
  "url": "https://math2.tamnd.com/wiki/paraconsistent-logic/",
  "writing": {
    "tag": "C7YWCR87QJ",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}