See Knaster-Tarski theorem in All languages combined, or Wiktionary
{
"etymology_text": "Named after Bronisław Knaster and Alfred Tarski.",
"forms": [
{
"form": "the Knaster-Tarski theorem",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Knaster-Tarski 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, if L is a complete lattice and f : L → L is an order-preserving function, then the set of fixed points of f in L is also a complete lattice. It has important applications in formal semantics of programming languages and abstract interpretation."
],
"id": "en-Knaster-Tarski_theorem-en-name-chf2zu1n",
"links": [
[
"mathematics",
"mathematics"
],
[
"complete",
"complete"
],
[
"lattice",
"lattice"
],
[
"order",
"order"
],
[
"function",
"function"
],
[
"fixed point",
"fixed point"
],
[
"formal",
"formal"
],
[
"semantics",
"semantics"
],
[
"programming language",
"programming language"
]
],
"raw_glosses": [
"(mathematics) A theorem stating that, if L is a complete lattice and f : L → L is an order-preserving function, then the set of fixed points of f in L is also a complete lattice. It has important applications in formal semantics of programming languages and abstract interpretation."
],
"synonyms": [
{
"word": "Tarski's fixed-point theorem"
}
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"Knaster-Tarski theorem"
]
}
],
"word": "Knaster-Tarski theorem"
}
{
"etymology_text": "Named after Bronisław Knaster and Alfred Tarski.",
"forms": [
{
"form": "the Knaster-Tarski theorem",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Knaster-Tarski 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, if L is a complete lattice and f : L → L is an order-preserving function, then the set of fixed points of f in L is also a complete lattice. It has important applications in formal semantics of programming languages and abstract interpretation."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"complete",
"complete"
],
[
"lattice",
"lattice"
],
[
"order",
"order"
],
[
"function",
"function"
],
[
"fixed point",
"fixed point"
],
[
"formal",
"formal"
],
[
"semantics",
"semantics"
],
[
"programming language",
"programming language"
]
],
"raw_glosses": [
"(mathematics) A theorem stating that, if L is a complete lattice and f : L → L is an order-preserving function, then the set of fixed points of f in L is also a complete lattice. It has important applications in formal semantics of programming languages and abstract interpretation."
],
"synonyms": [
{
"word": "Tarski's fixed-point theorem"
}
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"Knaster-Tarski theorem"
]
}
],
"word": "Knaster-Tarski theorem"
}
Download raw JSONL data for Knaster-Tarski theorem meaning in English (1.6kB)
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.