See superreflexivity in All languages combined, or Wiktionary
{ "etymology_templates": [ { "args": { "1": "en", "2": "super", "3": "reflexivity" }, "expansion": "super- + reflexivity", "name": "prefix" } ], "etymology_text": "From super- + reflexivity.", "head_templates": [ { "args": { "1": "?" }, "expansion": "superreflexivity", "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 prefixed with super-", "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, Siu Lam Leung, Sarah Nelson, Sofiya Ostrovska, Mikhail Ostrovskii, “Distortion of embeddings of binary trees into diamond graphs”, in arXiv:", "text": "Some results for these families of graphs are parallel to each other, for example superreflexivity of Banach spaces can be characterized both in terms of binary trees (Bourgain, 1986) and diamond graphs (Johnson-Schechtman, 2009).", "type": "quote" } ], "glosses": [ "The condition of being superreflexive" ], "id": "en-superreflexivity-en-noun-tgcjh34B", "links": [ [ "mathematics", "mathematics" ], [ "superreflexive", "superreflexive" ] ], "raw_glosses": [ "(mathematics) The condition of being superreflexive" ], "synonyms": [ { "word": "super-reflexivity" } ], "topics": [ "mathematics", "sciences" ] } ], "word": "superreflexivity" }
{ "etymology_templates": [ { "args": { "1": "en", "2": "super", "3": "reflexivity" }, "expansion": "super- + reflexivity", "name": "prefix" } ], "etymology_text": "From super- + reflexivity.", "head_templates": [ { "args": { "1": "?" }, "expansion": "superreflexivity", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English nouns", "English nouns with unknown or uncertain plurals", "English terms prefixed with super-", "English terms with quotations", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "examples": [ { "ref": "2015, Siu Lam Leung, Sarah Nelson, Sofiya Ostrovska, Mikhail Ostrovskii, “Distortion of embeddings of binary trees into diamond graphs”, in arXiv:", "text": "Some results for these families of graphs are parallel to each other, for example superreflexivity of Banach spaces can be characterized both in terms of binary trees (Bourgain, 1986) and diamond graphs (Johnson-Schechtman, 2009).", "type": "quote" } ], "glosses": [ "The condition of being superreflexive" ], "links": [ [ "mathematics", "mathematics" ], [ "superreflexive", "superreflexive" ] ], "raw_glosses": [ "(mathematics) The condition of being superreflexive" ], "topics": [ "mathematics", "sciences" ] } ], "synonyms": [ { "word": "super-reflexivity" } ], "word": "superreflexivity" }
Download raw JSONL data for superreflexivity meaning in English (1.4kB)
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.