{
  "id": "enwiki-001110079464",
  "slug": "two-variable-logic",
  "title": "Two-variable logic",
  "qid": "",
  "lead": "In mathematical logic and computer science, two-variable logic is the fragment of first-order logic where formulae can be written using only two different variables. This fragment is usually studied without function symbols.",
  "body": "In mathematical logic and computer science, two-variable logic is the fragment of first-order logic where formulae can be written using only two different variables. This fragment is usually studied without function symbols. Counting quantifiers actually improve the expressiveness of finite-variable logics as they allow to say that there is a node with n neighbors, namely \\Phi = \\exists x \\exists^{\\geq n} y E(x,y) . Without counting quantifiers n+1 variables are needed for the same formula.",
  "categories": [
    "23615796",
    "29176662"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1110079464",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1663067242.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001110079464",
    "type": "webpage",
    "title": "Two-variable logic",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/two-variable-logic",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001110079464",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1110079464",
    "note": "Immutable snapshot enwiki-001110079464"
  }
}