See decidable on Wiktionary
{
"antonyms": [
{
"word": "undecidable"
}
],
"derived": [
{
"_dis1": "0 0 0",
"word": "semi-decidable"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "decide",
"3": "able"
},
"expansion": "decide + -able",
"name": "suffix"
}
],
"etymology_text": "From decide + -able.",
"forms": [
{
"form": "more decidable",
"tags": [
"comparative"
]
},
{
"form": "most decidable",
"tags": [
"superlative"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "decidable (comparative more decidable, superlative most decidable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"_dis1": "0 0 0",
"word": "decidability"
}
],
"senses": [
{
"glosses": [
"capable of being decided."
],
"id": "en-decidable-en-adj-2Ji32zBb",
"links": [
[
"decided",
"decided"
]
],
"translations": [
{
"_dis1": "95 2 3",
"code": "cs",
"lang": "Czech",
"sense": "capable of being decided",
"tags": [
"masculine"
],
"word": "rozhodnutelný"
},
{
"_dis1": "95 2 3",
"code": "fi",
"lang": "Finnish",
"sense": "capable of being decided",
"word": "ratkaistavissa oleva"
},
{
"_dis1": "95 2 3",
"code": "de",
"lang": "German",
"sense": "capable of being decided",
"word": "entscheidbar"
},
{
"_dis1": "95 2 3",
"code": "es",
"lang": "Spanish",
"sense": "capable of being decided",
"word": "decidible"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "It is easy to show that the set of even numbers is decidable by creating the relevant Turing machine.",
"type": "example"
}
],
"glosses": [
"describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time."
],
"id": "en-decidable-en-adj-n8wFfo~U",
"links": [
[
"computer science",
"computer science"
],
[
"set",
"set"
],
[
"algorithm",
"algorithm"
],
[
"determine",
"determine"
],
[
"element",
"element"
],
[
"finite",
"finite"
]
],
"raw_glosses": [
"(computer science) describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"translations": [
{
"_dis1": "2 67 31",
"code": "fi",
"lang": "Finnish",
"sense": "computer science: describing a set",
"word": "ratkaistavissa oleva"
},
{
"_dis1": "2 67 31",
"code": "de",
"lang": "German",
"sense": "computer science: describing a set",
"word": "entscheidbar"
},
{
"_dis1": "2 67 31",
"code": "he",
"lang": "Hebrew",
"roman": "karí'a",
"sense": "computer science: describing a set",
"word": "כריע"
},
{
"_dis1": "2 67 31",
"code": "ro",
"lang": "Romanian",
"sense": "computer science: describing a set",
"word": "decidabil"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Logic",
"orig": "en:Logic",
"parents": [
"Formal sciences",
"Philosophy",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "2 41 57",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "11 32 57",
"kind": "other",
"name": "English terms suffixed with -able",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "3 34 63",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "2 39 59",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "2 37 61",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "7 31 62",
"kind": "other",
"name": "Terms with Czech translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "6 28 66",
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "6 29 65",
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "6 31 63",
"kind": "other",
"name": "Terms with Hebrew translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "6 28 66",
"kind": "other",
"name": "Terms with Romanian translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "4 32 64",
"kind": "other",
"name": "Terms with Spanish translations",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that \"either P or not P\", i.e. in symbols: P∨¬P."
],
"id": "en-decidable-en-adj-YHA5YYii",
"links": [
[
"logic",
"logic"
],
[
"intuitionistic logic",
"intuitionistic logic"
]
],
"raw_glosses": [
"(logic) in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that \"either P or not P\", i.e. in symbols: P∨¬P."
],
"topics": [
"human-sciences",
"logic",
"mathematics",
"philosophy",
"sciences"
]
}
],
"sounds": [
{
"ipa": "[dɪˈsaɪdəbəɫ]",
"tags": [
"UK"
]
},
{
"audio": "en-us-decidable.ogg",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/3/33/En-us-decidable.ogg/En-us-decidable.ogg.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/3/33/En-us-decidable.ogg"
}
],
"synonyms": [
{
"_dis1": "0 0 0",
"topics": [
"science",
"sciences",
"computer",
"computing",
"engineering",
"mathematics",
"physical-sciences",
"natural-sciences"
],
"word": "recursive"
},
{
"_dis1": "0 0 0",
"topics": [
"science",
"sciences",
"computer",
"computing",
"engineering",
"mathematics",
"physical-sciences",
"natural-sciences"
],
"word": "computable"
}
],
"word": "decidable"
}
{
"antonyms": [
{
"word": "undecidable"
}
],
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms suffixed with -able",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Czech translations",
"Terms with Finnish translations",
"Terms with German translations",
"Terms with Hebrew translations",
"Terms with Romanian translations",
"Terms with Spanish translations"
],
"derived": [
{
"word": "semi-decidable"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "decide",
"3": "able"
},
"expansion": "decide + -able",
"name": "suffix"
}
],
"etymology_text": "From decide + -able.",
"forms": [
{
"form": "more decidable",
"tags": [
"comparative"
]
},
{
"form": "most decidable",
"tags": [
"superlative"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "decidable (comparative more decidable, superlative most decidable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "decidability"
}
],
"senses": [
{
"glosses": [
"capable of being decided."
],
"links": [
[
"decided",
"decided"
]
]
},
{
"categories": [
"English terms with usage examples",
"en:Computer science"
],
"examples": [
{
"text": "It is easy to show that the set of even numbers is decidable by creating the relevant Turing machine.",
"type": "example"
}
],
"glosses": [
"describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time."
],
"links": [
[
"computer science",
"computer science"
],
[
"set",
"set"
],
[
"algorithm",
"algorithm"
],
[
"determine",
"determine"
],
[
"element",
"element"
],
[
"finite",
"finite"
]
],
"raw_glosses": [
"(computer science) describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
},
{
"categories": [
"en:Logic"
],
"glosses": [
"in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that \"either P or not P\", i.e. in symbols: P∨¬P."
],
"links": [
[
"logic",
"logic"
],
[
"intuitionistic logic",
"intuitionistic logic"
]
],
"raw_glosses": [
"(logic) in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that \"either P or not P\", i.e. in symbols: P∨¬P."
],
"topics": [
"human-sciences",
"logic",
"mathematics",
"philosophy",
"sciences"
]
}
],
"sounds": [
{
"ipa": "[dɪˈsaɪdəbəɫ]",
"tags": [
"UK"
]
},
{
"audio": "en-us-decidable.ogg",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/3/33/En-us-decidable.ogg/En-us-decidable.ogg.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/3/33/En-us-decidable.ogg"
}
],
"synonyms": [
{
"topics": [
"science",
"sciences",
"computer",
"computing",
"engineering",
"mathematics",
"physical-sciences",
"natural-sciences"
],
"word": "recursive"
},
{
"topics": [
"science",
"sciences",
"computer",
"computing",
"engineering",
"mathematics",
"physical-sciences",
"natural-sciences"
],
"word": "computable"
}
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"sense": "capable of being decided",
"tags": [
"masculine"
],
"word": "rozhodnutelný"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "capable of being decided",
"word": "ratkaistavissa oleva"
},
{
"code": "de",
"lang": "German",
"sense": "capable of being decided",
"word": "entscheidbar"
},
{
"code": "es",
"lang": "Spanish",
"sense": "capable of being decided",
"word": "decidible"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "computer science: describing a set",
"word": "ratkaistavissa oleva"
},
{
"code": "de",
"lang": "German",
"sense": "computer science: describing a set",
"word": "entscheidbar"
},
{
"code": "he",
"lang": "Hebrew",
"roman": "karí'a",
"sense": "computer science: describing a set",
"word": "כריע"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "computer science: describing a set",
"word": "decidabil"
}
],
"word": "decidable"
}
Download raw JSONL data for decidable meaning in All languages combined (4.0kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.