{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nSome systems of logic have different but analogous laws. For some finite *n*-valued logics, there is an analogous law called the *law of excluded*n*\\+1th*. If negation is cyclic and \"∨\" is a \"max operator\", then the law can be expressed in the object language by (P ∨ ~P ∨ ~~P ∨ ... ∨ ~...~P), where \"~...~\" represents *n*−1 negation signs and \"∨ ... ∨\" *n*−1 disjunction signs. It is easy to check that the sentence must receive at least one of the *n* truth values (and not a value that is not one of the *n*).\n\nOther systems reject the law entirely.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "B32CDRRP0Y"
    ],
    "kind": "statement",
    "msc": [
      "03B05"
    ],
    "name": "Analogous laws",
    "role": "proposition",
    "sources": [
      {
        "locator": "Law of excluded middle, section Analogous laws",
        "mention": "wikipedia://en/17637#0GWC",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:17637@r1370685960"
      }
    ],
    "tag": "AZPR5803TY"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/AZPR5803TY/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/AZPR5803TY.md",
  "msc": [
    "03B05"
  ],
  "name": "Analogous laws",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/AZP/AZPR5803TY.md",
  "status": null,
  "tag": "AZPR5803TY",
  "uri": "m2://AZPR5803TY",
  "url": "https://math2.tamnd.com/wiki/analogous-laws/",
  "writing": {
    "tag": "AZPR5803TY",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}