"Zermelo's theorem" meaning in All languages combined

{
  "etymology_text": "Named after Ernst Zermelo.",
  "head_templates": [
    {
      "args": {
        "head": "Zermelo's theorem"
      },
      "expansion": "Zermelo's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Game theory",
          "orig": "en:Game theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "85 15",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "78 22",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "88 12",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win."
      ],
      "id": "en-Zermelo's_theorem-en-name-Np7TY6gG",
      "links": [
        [
          "game theory",
          "game theory"
        ]
      ],
      "raw_glosses": [
        "(game theory) A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win."
      ],
      "topics": [
        "computing",
        "engineering",
        "game-theory",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Set theory",
          "orig": "en:Set theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The well-ordering theorem."
      ],
      "id": "en-Zermelo's_theorem-en-name-63uwRDLt",
      "links": [
        [
          "set theory",
          "set theory"
        ]
      ],
      "raw_glosses": [
        "(set theory) The well-ordering theorem."
      ],
      "topics": [
        "mathematics",
        "sciences",
        "set-theory"
      ]
    }
  ],
  "wikipedia": [
    "Ernst Zermelo",
    "Zermelo's theorem",
    "Zermelo's theorem (game theory)"
  ],
  "word": "Zermelo's theorem"
}

{
  "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"
  ],
  "etymology_text": "Named after Ernst Zermelo.",
  "head_templates": [
    {
      "args": {
        "head": "Zermelo's theorem"
      },
      "expansion": "Zermelo's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "en:Game theory"
      ],
      "glosses": [
        "A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win."
      ],
      "links": [
        [
          "game theory",
          "game theory"
        ]
      ],
      "raw_glosses": [
        "(game theory) A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win."
      ],
      "topics": [
        "computing",
        "engineering",
        "game-theory",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    },
    {
      "categories": [
        "en:Set theory"
      ],
      "glosses": [
        "The well-ordering theorem."
      ],
      "links": [
        [
          "set theory",
          "set theory"
        ]
      ],
      "raw_glosses": [
        "(set theory) The well-ordering theorem."
      ],
      "topics": [
        "mathematics",
        "sciences",
        "set-theory"
      ]
    }
  ],
  "wikipedia": [
    "Ernst Zermelo",
    "Zermelo's theorem",
    "Zermelo's theorem (game theory)"
  ],
  "word": "Zermelo's theorem"
}