English Dictionary

Zermelo's theorem

name

(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.

Zermelo's theorem is a fundamental result in set theory.

意味（1）

(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.

意味（2）

(set theory) The well-ordering theorem.