See TQBF on Wiktionary
{
"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": "",
"nolinkhead": "",
"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": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"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"
],
"id": "en-TQBF-mul-symbol-9acpnGqV",
"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": "",
"nolinkhead": "",
"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": [
"Pages with 1 entry",
"Pages with entries",
"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"
],
"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"
}
Download raw JSONL data for TQBF meaning in All languages combined (1.8kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-25 from the enwiktionary dump dated 2025-01-20 using wiktextract (c15a5ce and 5c11237). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.