"TQBF" meaning in Translingual

{
  "etymology_templates": [
    {
      "args": {
        "1": "mul",
        "2": "en",
        "3": "-"
      },
      "expansion": "English",
      "name": "der"
    }
  ],
  "etymology_text": "From English True (or totally) quantified Boolean formula.",
  "head_templates": [
    {
      "args": {
        "1": "mul",
        "10": "",
        "2": "symbol",
        "3": "",
        "4": "",
        "5": "or",
        "6": "",
        "7": "or",
        "8": "",
        "9": "or",
        "cat2": "",
        "f1lang": "en",
        "f1nolink": "",
        "f2lang": "en",
        "f2nolink": "",
        "f3lang": "en",
        "f3nolink": "",
        "f4lang": "en",
        "f4nolink": "",
        "head": "",
        "head2": "",
        "head3": "",
        "head4": "",
        "sc": "Latn",
        "sort": ""
      },
      "expansion": "TQBF",
      "name": "head"
    },
    {
      "args": {},
      "expansion": "TQBF",
      "name": "mul-symbol"
    }
  ],
  "lang": "Translingual",
  "lang_code": "mul",
  "pos": "symbol",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "Translingual entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Translingual terms with redundant script codes",
          "parents": [
            "Terms with redundant script codes",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "mul",
          "name": "Theory of computing",
          "orig": "mul:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "∃x_1∀x_2∃x_3...Q_nx_nf(x_1,x_2,x_3,...,x_n)"
        },
        {
          "text": "Where Q_n is ∀ if n is even and ∃ if n is odd."
        }
      ],
      "glosses": [
        "The decision problem of, given a Boolean function f on n variables, deciding whether the following formula is satisfiable:",
        "The decision problem of, given a Boolean function f on n variables, deciding whether the following formula is satisfiable"
      ],
      "id": "en-TQBF-mul-symbol-y2EYPNGK",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "Boolean function",
          "Boolean function"
        ],
        [
          "satisfiable",
          "satisfiable"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The decision problem of, given a Boolean function f on n variables, deciding whether the following formula is satisfiable:"
      ],
      "related": [
        {
          "word": "SAT"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "True quantified Boolean formula"
      ]
    }
  ],
  "word": "TQBF"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "mul",
        "2": "en",
        "3": "-"
      },
      "expansion": "English",
      "name": "der"
    }
  ],
  "etymology_text": "From English True (or totally) quantified Boolean formula.",
  "head_templates": [
    {
      "args": {
        "1": "mul",
        "10": "",
        "2": "symbol",
        "3": "",
        "4": "",
        "5": "or",
        "6": "",
        "7": "or",
        "8": "",
        "9": "or",
        "cat2": "",
        "f1lang": "en",
        "f1nolink": "",
        "f2lang": "en",
        "f2nolink": "",
        "f3lang": "en",
        "f3nolink": "",
        "f4lang": "en",
        "f4nolink": "",
        "head": "",
        "head2": "",
        "head3": "",
        "head4": "",
        "sc": "Latn",
        "sort": ""
      },
      "expansion": "TQBF",
      "name": "head"
    },
    {
      "args": {},
      "expansion": "TQBF",
      "name": "mul-symbol"
    }
  ],
  "lang": "Translingual",
  "lang_code": "mul",
  "pos": "symbol",
  "related": [
    {
      "word": "SAT"
    }
  ],
  "senses": [
    {
      "categories": [
        "Translingual entries with incorrect language header",
        "Translingual lemmas",
        "Translingual symbols",
        "Translingual terms derived from English",
        "Translingual terms with redundant script codes",
        "mul:Theory of computing"
      ],
      "examples": [
        {
          "text": "∃x_1∀x_2∃x_3...Q_nx_nf(x_1,x_2,x_3,...,x_n)"
        },
        {
          "text": "Where Q_n is ∀ if n is even and ∃ if n is odd."
        }
      ],
      "glosses": [
        "The decision problem of, given a Boolean function f on n variables, deciding whether the following formula is satisfiable:",
        "The decision problem of, given a Boolean function f on n variables, deciding whether the following formula is satisfiable"
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "Boolean function",
          "Boolean function"
        ],
        [
          "satisfiable",
          "satisfiable"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The decision problem of, given a Boolean function f on n variables, deciding whether the following formula is satisfiable:"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "True quantified Boolean formula"
      ]
    }
  ],
  "word": "TQBF"
}