Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite two-person games of perfect information
|
| gptkbp:field |
gptkb:set_theory
game theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Zermelo's theorem
|
| gptkbp:influenced |
gptkb:logic
game theory |
| gptkbp:namedAfter |
gptkb:Ernst_Zermelo
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Fifth_International_Congress_of_Mathematicians,_Cambridge,_1912
|
| gptkbp:relatedTo |
combinatorial game theory
chess game determinacy |
| gptkbp:sentence |
In any finite two-person game of perfect information, one of the players has a winning strategy or both have strategies guaranteeing at least a draw.
|
| gptkbp:yearProposed |
1913
|
| gptkbp:bfsParent |
gptkb:Ernst_Zermelo
|
| gptkbp:bfsLayer |
4
|