See tricomplexity in All languages combined, or Wiktionary
{ "etymology_templates": [ { "args": { "1": "en", "2": "tricomplex", "3": "ity" }, "expansion": "tricomplex + -ity", "name": "suf" } ], "etymology_text": "From tricomplex + -ity.", "head_templates": [ { "args": { "1": "-" }, "expansion": "tricomplexity (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": "English terms suffixed with -ity", "parents": [], "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" } ], "examples": [ { "ref": "2015, Giorgi Japaridze, “Build your own clarithmetic II”, in arXiv:", "text": "Furthermore, through tuning the 4th parameter P4, at the cost of sacrificing recursive axiomatizability but not simplicity or elegance, the above extensional completeness can be strengthened to intensional completeness, according to which every formula representing a problem with a solution from the given tricomplexity class is a theorem of the system.", "type": "quote" } ], "glosses": [ "The condition of being tricomplex" ], "id": "en-tricomplexity-en-noun-08cmstJk", "links": [ [ "mathematics", "mathematics" ], [ "tricomplex", "tricomplex" ] ], "raw_glosses": [ "(mathematics) The condition of being tricomplex" ], "tags": [ "uncountable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "tricomplexity" }
{ "etymology_templates": [ { "args": { "1": "en", "2": "tricomplex", "3": "ity" }, "expansion": "tricomplex + -ity", "name": "suf" } ], "etymology_text": "From tricomplex + -ity.", "head_templates": [ { "args": { "1": "-" }, "expansion": "tricomplexity (uncountable)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English entries with incorrect language header", "English lemmas", "English nouns", "English terms suffixed with -ity", "English terms with quotations", "English uncountable nouns", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "examples": [ { "ref": "2015, Giorgi Japaridze, “Build your own clarithmetic II”, in arXiv:", "text": "Furthermore, through tuning the 4th parameter P4, at the cost of sacrificing recursive axiomatizability but not simplicity or elegance, the above extensional completeness can be strengthened to intensional completeness, according to which every formula representing a problem with a solution from the given tricomplexity class is a theorem of the system.", "type": "quote" } ], "glosses": [ "The condition of being tricomplex" ], "links": [ [ "mathematics", "mathematics" ], [ "tricomplex", "tricomplex" ] ], "raw_glosses": [ "(mathematics) The condition of being tricomplex" ], "tags": [ "uncountable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "tricomplexity" }
Download raw JSONL data for tricomplexity meaning in English (1.3kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.