The Church Problem for Countable Ordinals
A fundamental theorem of Buchi and Landweber shows that the Church synthesis problem is computable. Buchi and Landweber reduced the Church Problem to problems about ω-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural gener...
Main Author: | Alexander Rabinovich |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2009-04-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1204/pdf |
Similar Items
-
The Church Synthesis Problem with Parameters
by: Alexander Rabinovich
Published: (2007-11-01) -
Cores of Countably Categorical Structures
by: Manuel Bodirsky
Published: (2007-01-01) -
The complexity of linear-time temporal logic over the class of ordinals
by: Stephane Demri, et al.
Published: (2010-12-01) -
Expressiveness of Metric modalities for continuous time
by: Yoram Hirshfeld, et al.
Published: (2007-02-01) -
The Algebraic Intersection Type Unification Problem
by: Andrej Dudenhefner, et al.
Published: (2017-08-01)