Game characterizations and lower cones in the Weihrauch degrees
arXiv:1511.03693 · doi:10.23638/LMCS-15(3:11)2019
Abstract
We introduce a parametrized version of the Wadge game for functions and show that each lower cone in the Weihrauch degrees is characterized by such a game. These parametrized Wadge games subsume the original Wadge game, the eraser and backtrack games as well as Semmes's tree games. In particular, we propose that the lower cones in the Weihrauch degrees are the answer to Andretta's question on which classes of functions admit game characterizations. We then discuss some applications of such parametrized Wadge games. Using machinery from Weihrauch reducibility theory, we introduce games characterizing every (transfinite) level of the Baire hierarchy via an iteration of a pruning derivative on countably branching trees.
References in corpus (9)
- On the algebraic structure of Weihrauch degrees
- Probabilistic Computability and Choice
- A comparison of concepts from computable analysis and effective descriptive set theory
- Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces
- The descriptive theory of represented spaces
- Game characterizations and lower cones in the Weihrauch degrees
- Results in descriptive set theory on some represented spaces
- Point degree spectra of represented spaces
- Computability on the space of countable ordinals