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 generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length. We prove that determinacy and decidability parts of the Bu}chi and Landweber theorem hold for all countable ordinals and that its full extension holds for all ordinals < \omega^\omega.

💡 Research Summary

The paper “The Church Problem for Countable Ordinals” extends the classical Church synthesis problem, originally solved for ω‑length games by Büchi and Landweber, to games of arbitrary countable length. The authors first recall the original Büchi‑Landweber theorem, which guarantees four properties for ω‑games: (i) determinacy (one player always has a winning strategy), (ii) decidability of which player wins, (iii) existence of a definable (MLO‑definable) winning strategy, and (iv) an effective synthesis algorithm that produces a finite‑state automaton implementing the strategy.

The central object of study is the McNaughton game Gαϕ for an ordinal α > 0 and an MLO formula ϕ(X₁,X₂). The game proceeds in α rounds; at each round β < α Player I chooses a bit for X₁(β) and Player II subsequently chooses a bit for X₂(β). After all rounds the sets Pπ and Qπ are formed from the two sequences, and Player I wins exactly when (α,<) ⊨ ϕ(Pπ,Qπ). The question is whether one of the players has a winning (causal) strategy and whether this can be decided algorithmically.

To answer this, the authors introduce the notion of “game types”. For a fixed quantifier depth n, the set Charₙ² consists of all characteristic MLO formulas (Hintikka formulas) with free variables X₁,X₂. Any formula of depth n is equivalent to a disjunction of a subset G⊆Charₙ², and the game Gαϕ can be reduced to the game GαG defined by that subset. Thus it suffices to prove determinacy and decidability for games of the form GαG.

The technical core relies on the composition method of Feferman‑Vaught and Shelah. The paper reviews n‑types, ordered sums of chains, and the ordered sum of n‑types. Lemma 2.3 (Hintikka Lemma) guarantees a finite set of characteristic formulas for each n‑type, and Theorem 2.8 (Composition Theorem) provides a computable formula ψ that captures the truth of any given formula over an ordered sum of structures. Using these tools, the authors show that taking ordered sums preserves ≡ₙ‑equivalence (Proposition 2.6) and that the sum and product operations on n‑types are recursive (Theorems 2.9 and 2.10).

With these ingredients they prove the main result (Theorem 1.5): for every countable ordinal α and every MLO formula ϕ, (1) the game Gαϕ is determined, and (2) there is an algorithm that, given α (via its canonical code) and ϕ, decides which player has a winning strategy. The algorithm works by computing the set G of characteristic formulas equivalent to ϕ, constructing the corresponding ψ from the composition theorem, and evaluating ψ on the code of α – a process made effective by the “code theorem” (Theorem 2.12) which states that the monadic theory of any countable ordinal is decidable from its code.

The paper also revisits the boundary of the full Büchi‑Landweber theorem. Shomrat (2007) exhibited a selector formula ψα that is true in every α ≥ ω^ω but cannot be defined by any MLO formula. Using this, the authors confirm Shomrat’s theorem (Theorem 1.4) that the full extension (including definable strategies and synthesis) holds exactly for ordinals α < ω^ω. For α ≥ ω^ω, while determinacy and decidability remain true, there need not exist an MLO‑definable winning strategy, and the synthesis algorithm cannot be guaranteed.

Section 8 provides an MLO characterisation of the winner: for each ϕ there exists a sentence ψ such that for every countable α, Player I wins Gαϕ iff (α,<) ⊨ ψ. This reduces the winner‑determination problem to a pure logical satisfaction test.

Section 9 discusses the open problem of deciding the existence of a definable winning strategy for α ≥ ω^ω. The authors reduce this problem to the case of ω^ω‑length games, showing that a general decision procedure would imply a solution for the ω^ω case, which remains unresolved.

The conclusion summarises the contributions: (i) determinacy and decidability of the Church problem for all countable ordinals, (ii) a clear delineation of the exact range (α < ω^ω) where the full Büchi‑Landweber theorem extends, and (iii) a framework combining infinite game theory with the composition method that may be applicable to further extensions (e.g., uncountable ordinals or richer logics). Open questions include the complexity of the decision procedures, extensions to uncountable ordinals, and the precise boundary for definable strategies.