{
  "aliases": [
    "sentential-logic",
    "propositional-calculus"
  ],
  "backlinks": [
    {
      "field": "uses",
      "target": "086QKPF0A6"
    },
    {
      "field": "uses",
      "target": "0D1AHYPM8N"
    }
  ],
  "body": "\n## Summary\n\nPropositional logic is the part of logic that studies [[propositions|0ZGC7ZESYN]] and the connectives that join them.\nIts formulas are made from propositional variables with connectives such as $\\neg$, $\\land$, $\\lor$, $\\to$ and $\\leftrightarrow$.\nIt does not look inside a proposition, so it has no variables for objects and no quantifiers.\n\n## Remarks\n\nOther names are sentential logic and propositional calculus.\nIn classical propositional logic, the value of a formula depends only on the values of its variables. A [[truth table|05RSK4Q657]] computes it.\n[[Predicate logic|086QKPF0A6]] extends propositional logic with predicates and quantifiers.\n\n## Explanations\n\n### L1 human\n\nIn propositional logic, a sentence such as \"$7$ is prime\" is one unit $p$.\nYou study only how such units combine with \"not\", \"and\", \"or\" and \"if ... then\".\nFor example, $p \\lor \\neg p$ is true whatever $p$ says.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "aliases": [
      "sentential-logic",
      "propositional-calculus"
    ],
    "kind": "concept",
    "msc": [
      "03B05"
    ],
    "name": "Propositional logic",
    "same_as": {
      "wikidata": "Q200694",
      "wikipedia": "Propositional logic"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Propositional_logic"
      }
    ],
    "tag": "09K9MWD2QQ",
    "uses": [
      "0ZGC7ZESYN",
      "0XR7A7RSXB",
      "0M28ASWG8T",
      "0H5GKDTB01",
      "0ZNX6DQ3EJ",
      "0V6GAWTBYW"
    ]
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/09K9MWD2QQ/",
  "links": [
    {
      "field": "uses",
      "target": "0ZGC7ZESYN"
    },
    {
      "field": "uses",
      "target": "0XR7A7RSXB"
    },
    {
      "field": "uses",
      "target": "0M28ASWG8T"
    },
    {
      "field": "uses",
      "target": "0H5GKDTB01"
    },
    {
      "field": "uses",
      "target": "0ZNX6DQ3EJ"
    },
    {
      "field": "uses",
      "target": "0V6GAWTBYW"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/09K9MWD2QQ.md",
  "msc": [
    "03B05"
  ],
  "name": "Propositional logic",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/09K/09K9MWD2QQ.md",
  "status": null,
  "tag": "09K9MWD2QQ",
  "uri": "m2://09K9MWD2QQ",
  "url": "https://math2.tamnd.com/wiki/propositional-logic/",
  "writing": {
    "tag": "09K9MWD2QQ",
    "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
      }
    ]
  }
}