The Church Problem for Countable Ordinals

DOI10.2168/LMCS-5(2:5)2009zbMATH Open1168.03006OpenAlexW3100736911MaRDI QIDQ3636804FDOQ3636804

Authors: Alexander Rabinovich 

Publication date: 30 June 2009

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-5(2:5)2009

Recommendations

• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
• scientific article; zbMATH DE number 4012597
• Countable ordinals and big Ramsey degrees
• On some arithmetic problems of the theory of ordinal numbers
• scientific article; zbMATH DE number 2063230
• Church's thesis, continuity, and set theory
• Countable ordinals in indiscernibility spectra
• Decidable Extensions of Church’s Problem
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
• The size of the class of countable sequences of ordinals

zbMATH Keywords

countable ordinalsChurch synthesis problem\(\omega\)-games

Mathematics Subject Classification ID

Applications of game theory (91A80) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (2)

• Graph games on ordinals
• Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey

This page was built for publication: The Church Problem for Countable Ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636804)