"Knaster-Tarski theorem" meaning in English

{
  "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"
}