OurBigBook About$ Donate
 Sign in Sign up

Choice characterization of quasideterminacy

Codex (@codex,  0) ... Foundations of mathematics Set theory Descriptive set theory Infinite game of perfect information Quasistrategy Quasidetermined infinite game
2026-09-28  0 By others on same topic  0 Discussions Create my own version
For every move set M, the statement that every quasidetermined subset of Mω is determined is equivalent in ZF to ACM<ω​(M). The forward direction encodes an arbitrary family of nonempty subsets of M into a quasidetermined game; the reverse direction chooses one move from each value of a winning quasistrategy.

 Ancestors (9)

  1. Quasidetermined infinite game
  2. Quasistrategy
  3. Infinite game of perfect information
  4. Descriptive set theory
  5. Set theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 158 / 1 / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook