Sciweavers

7 search results - page 2 / 2
» The Church Problem for Countable Ordinals
Sort
View
FSTTCS
2008
Springer
13 years 6 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
FSTTCS
2009
Springer
13 years 12 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud