Game Characterizations and Lower Cones in the Weihrauch Degrees

Authors
Publication date 2017
Host editors
  • J. Kari
  • F. Manea
  • I. Petre
Book title Unveiling Dynamics and Complexity
Book subtitle 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings
ISBN
  • 9783319587400
ISBN (electronic)
  • 9783319587417
Series Lecture Notes in Computer Science
Event Computability in Europe 2017
Pages (from-to) 327-337
Publisher Cham: Springer
Organisations
  • Faculty of Science (FNWI)
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract We introduce generalized Wadge games and show that each lower cone in the Weihrauch degrees is characterized by such a game. These generalized Wadge games subsume (a variant of) 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 generalized Wadge games.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-319-58741-7_31
Permalink to this page
Back