Matches in DBpedia 2015-10 for { ?s ?p "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. It was proved by Donald A. Martin in 1975. The theorem is applied in descriptive set theory to show that Borel sets in Polish spaces have regularity properties such as the perfect set property and the property of Baire.The theorem is also known for its metamathematical properties."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Borel_determinacy_theorem comment "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. It was proved by Donald A. Martin in 1975. The theorem is applied in descriptive set theory to show that Borel sets in Polish spaces have regularity properties such as the perfect set property and the property of Baire.The theorem is also known for its metamathematical properties.".