Borel determinacy theorem
id:
borel-determinacy-theorem-267-535629
title:
Borel determinacy theorem
text:
In descriptive set theory, the Borel determinacy theorem states that any Gale–Stewart game whose payoff set is a Borel set is determined, meaning that one of the two players will have a winning strategy for the game. A Gale–Stewart game is a possibly infinite two-player game, where both players have perfect information and no randomness is involved. The theorem is a far reaching generalization of Zermelo's theorem about the determinacy of finite games. It was proved by Donald A. Martin in 1975,
brand slug:
wiki
category slug:
encyclopedia
description:
Theorem in descriptive set theory
original url:
https://en.wikipedia.org/wiki/Borel_determinacy_theorem
date created:
date modified:
2024-01-10T13:03:22Z
main entity:
{"identifier":"Q4944906","url":"https://www.wikidata.org/entity/Q4944906"}
image:
fields total:
13
integrity:
14