"Kleene fixed-point theorem" meaning in English

See Kleene fixed-point theorem in All languages combined, or Wiktionary

Proper name

Forms: the Kleene fixed-point theorem [canonical]
Etymology: Named after American mathematician Stephen Cole Kleene. Head templates: {{en-prop|def=1}} the Kleene fixed-point theorem
  1. (mathematics) Suppose (L,⊑) is a directed-complete partial order with a least element, and let f:L→L be a Scott-continuous (and therefore monotone) function. Then f has a least fixed point, which is the supremum of the ascending Kleene chain of f. Categories (topical): Mathematics Synonyms: Kleene's fixed-point theorem
    Sense id: en-Kleene_fixed-point_theorem-en-name-sN9xOZ-M Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Topics: mathematics, sciences

Alternative forms

{
  "etymology_text": "Named after American mathematician Stephen Cole Kleene.",
  "forms": [
    {
      "form": "the Kleene fixed-point theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Kleene fixed-point theorem",
      "name": "en-prop"
    }
  ],
  "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": [
        "Suppose (L,⊑) is a directed-complete partial order with a least element, and let f:L→L be a Scott-continuous (and therefore monotone) function. Then f has a least fixed point, which is the supremum of the ascending Kleene chain of f."
      ],
      "id": "en-Kleene_fixed-point_theorem-en-name-sN9xOZ-M",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "least",
          "least"
        ],
        [
          "element",
          "element"
        ],
        [
          "Scott-continuous",
          "Scott-continuous"
        ],
        [
          "monotone",
          "monotone function"
        ],
        [
          "function",
          "function"
        ],
        [
          "supremum",
          "supremum"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Suppose (L,⊑) is a directed-complete partial order with a least element, and let f:L→L be a Scott-continuous (and therefore monotone) function. Then f has a least fixed point, which is the supremum of the ascending Kleene chain of f."
      ],
      "synonyms": [
        {
          "word": "Kleene's fixed-point theorem"
        }
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Kleene fixed-point theorem"
}
{
  "etymology_text": "Named after American mathematician Stephen Cole Kleene.",
  "forms": [
    {
      "form": "the Kleene fixed-point theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Kleene fixed-point theorem",
      "name": "en-prop"
    }
  ],
  "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": [
        "Suppose (L,⊑) is a directed-complete partial order with a least element, and let f:L→L be a Scott-continuous (and therefore monotone) function. Then f has a least fixed point, which is the supremum of the ascending Kleene chain of f."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "least",
          "least"
        ],
        [
          "element",
          "element"
        ],
        [
          "Scott-continuous",
          "Scott-continuous"
        ],
        [
          "monotone",
          "monotone function"
        ],
        [
          "function",
          "function"
        ],
        [
          "supremum",
          "supremum"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Suppose (L,⊑) is a directed-complete partial order with a least element, and let f:L→L be a Scott-continuous (and therefore monotone) function. Then f has a least fixed point, which is the supremum of the ascending Kleene chain of f."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "Kleene's fixed-point theorem"
    }
  ],
  "word": "Kleene fixed-point theorem"
}

Download raw JSONL data for Kleene fixed-point theorem 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 2025-02-03 from the enwiktionary dump dated 2025-01-20 using wiktextract (05fdf6b and 9dbd323). 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.