See computation tree logic on Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "computation tree logic (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A particular modal logic of branching time with operators \"next\", \"globally\", \"finally\" or \"eventually\", \"until\", and \"weak until\"."
],
"id": "en-computation_tree_logic-en-noun-i5rKPDl2",
"links": [
[
"computer science",
"computer science"
]
],
"raw_glosses": [
"(computer science) A particular modal logic of branching time with operators \"next\", \"globally\", \"finally\" or \"eventually\", \"until\", and \"weak until\"."
],
"synonyms": [
{
"tags": [
"uncommon"
],
"word": "computational tree logic"
},
{
"word": "CTL"
}
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"wikipedia": [
"computation tree logic"
]
}
],
"word": "computation tree logic"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "computation tree logic (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Computer science"
],
"glosses": [
"A particular modal logic of branching time with operators \"next\", \"globally\", \"finally\" or \"eventually\", \"until\", and \"weak until\"."
],
"links": [
[
"computer science",
"computer science"
]
],
"raw_glosses": [
"(computer science) A particular modal logic of branching time with operators \"next\", \"globally\", \"finally\" or \"eventually\", \"until\", and \"weak until\"."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"wikipedia": [
"computation tree logic"
]
}
],
"synonyms": [
{
"tags": [
"uncommon"
],
"word": "computational tree logic"
},
{
"word": "CTL"
}
],
"word": "computation tree logic"
}
Download raw JSONL data for computation tree logic meaning in All languages combined (1.1kB)
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.