Infinite games and uniformization

Authors:
Wolfgang Thomas
Affiliations:
RWTH Aachen University, Aachen, Germany
Venue:
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Year:
2011

Citing 5
Cited 0

Automata, Languages, and Machines

Automata, Languages, and Machines
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Elements of Automata Theory

Elements of Automata Theory
Decidable theories of the ordering of natural numbers with unary predicates

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Degrees of lookahead in regular infinite games

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of solvability of infinite games is closely connected with the classical question of uniformization of relations by functions of a given class. We work out this connection and discuss recent results on infinite games that are motivated by the uniformization problem.