Non-determinacy of the cut-and-choose game on a Bernstein subset of the double arrow space
Statement
Let be a Bernstein set, and let denote the double arrow space. Define
Non-determinacy problem. The game is not determined.
This asks whether neither player has a winning strategy in the specified cut-and-choose game; the supplied context does not state whether the problem is solved or remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.