See Teichmüller-Tukey lemma in All languages combined, or Wiktionary
Download JSON data for Teichmüller-Tukey lemma meaning in English (1.6kB)
{
"etymology_text": "Named after John Tukey and Oswald Teichmüller.",
"forms": [
{
"form": "the Tukey-Teichmüller lemma",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1",
"head": "Tukey-Teichmüller lemma"
},
"expansion": "the Tukey-Teichmüller lemma",
"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": "English entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A lemma stating that every non-empty collection of finite character has a maximal element with respect to inclusion."
],
"id": "en-Teichmüller-Tukey_lemma-en-name-3B0LKcEw",
"links": [
[
"mathematics",
"mathematics"
]
],
"raw_glosses": [
"(mathematics) A lemma stating that every non-empty collection of finite character has a maximal element with respect to inclusion."
],
"synonyms": [
{
"word": "Tukey's lemma"
}
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"John Tukey",
"Oswald Teichmüller",
"Teichmüller-Tukey lemma"
]
}
],
"word": "Teichmüller-Tukey lemma"
}
{
"etymology_text": "Named after John Tukey and Oswald Teichmüller.",
"forms": [
{
"form": "the Tukey-Teichmüller lemma",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1",
"head": "Tukey-Teichmüller lemma"
},
"expansion": "the Tukey-Teichmüller lemma",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms spelled with Ü",
"English terms spelled with ◌̈",
"English terms with non-redundant non-automated sortkeys",
"English uncountable nouns",
"en:Mathematics"
],
"glosses": [
"A lemma stating that every non-empty collection of finite character has a maximal element with respect to inclusion."
],
"links": [
[
"mathematics",
"mathematics"
]
],
"raw_glosses": [
"(mathematics) A lemma stating that every non-empty collection of finite character has a maximal element with respect to inclusion."
],
"synonyms": [
{
"word": "Tukey's lemma"
}
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"John Tukey",
"Oswald Teichmüller",
"Teichmüller-Tukey lemma"
]
}
],
"word": "Teichmüller-Tukey lemma"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-20 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). 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.