See Matiyasevich's theorem on Wiktionary
{ "etymology_text": "Named after Russian mathematician Yuri Matiyasevich.", "head_templates": [ { "args": {}, "expansion": "Matiyasevich's theorem", "name": "en-proper noun" } ], "lang": "English", "lang_code": "en", "pos": "name", "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": "Mathematics", "orig": "en:Mathematics", "parents": [ "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "glosses": [ "A theorem stating that every computably enumerable set is a Diophantine set, and the converse." ], "id": "en-Matiyasevich's_theorem-en-name-J8pOXhSi", "links": [ [ "mathematics", "mathematics" ], [ "theorem", "theorem" ], [ "computably enumerable", "computably enumerable" ], [ "set", "set" ], [ "Diophantine set", "Diophantine set" ], [ "converse", "converse" ] ], "raw_glosses": [ "(mathematics) A theorem stating that every computably enumerable set is a Diophantine set, and the converse." ], "synonyms": [ { "word": "MRDP theorem" } ], "topics": [ "mathematics", "sciences" ], "wikipedia": [ "Yuri Matiyasevich" ] } ], "word": "Matiyasevich's theorem" }
{ "etymology_text": "Named after Russian mathematician Yuri Matiyasevich.", "head_templates": [ { "args": {}, "expansion": "Matiyasevich's theorem", "name": "en-proper noun" } ], "lang": "English", "lang_code": "en", "pos": "name", "senses": [ { "categories": [ "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English proper nouns", "English uncountable nouns", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "glosses": [ "A theorem stating that every computably enumerable set is a Diophantine set, and the converse." ], "links": [ [ "mathematics", "mathematics" ], [ "theorem", "theorem" ], [ "computably enumerable", "computably enumerable" ], [ "set", "set" ], [ "Diophantine set", "Diophantine set" ], [ "converse", "converse" ] ], "raw_glosses": [ "(mathematics) A theorem stating that every computably enumerable set is a Diophantine set, and the converse." ], "synonyms": [ { "word": "MRDP theorem" } ], "topics": [ "mathematics", "sciences" ], "wikipedia": [ "Yuri Matiyasevich" ] } ], "word": "Matiyasevich's theorem" }
Download raw JSONL data for Matiyasevich's theorem 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-08 from the enwiktionary dump dated 2025-01-01 using wiktextract (9a96ef4 and 4ed51a5). 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.