2013/02/28 by Nicholas Asher, Soumya Paul
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #Computer science #Economics #Hierarchy #Jump #Mathematical Dynamics and Fractals #Mathematical economics #Mathematics #Programming language #Set (abstract data type) #cs.GT #cs.LO
paper · pdf · doi:10.4204/eptcs.112.7
published as EPTCS 112, 2013, pp. 25-32 · In Proceedings SR 2013, arXiv:1303.0071
openalex publication_date 2013/02/28 · arxiv created 2013/03/04 · arxiv updated 2013/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore what happens to sets in various levels of the Borel hierarchy under such a situation. We show that the sets at every alternate level of the hierarchy jump to the next higher level.