Rabin's uniformization problem

DOI10.2307/2273673zbMath0537.03007OpenAlexW2170458819MaRDI QIDQ3322069

Saharon Shelah, Yuri Gurevich

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cef4676bd8653e76e3ab1dd41e4612699eb038e1

zbMATH Keywords

uniformization problemmonadic second order theory of the full binary treeS2S

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (24)

Tree-automatic scattered linear orders ⋮ On the Ehrenfeucht-Fraïssé game in theoretical computer science ⋮ Asymptotic Monadic Second-Order Logic ⋮ Delay Games with WMSO$$+$$U Winning Conditions ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Composition Over the Natural Number Ordering with an Extra Binary Relation ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Counting on CTL\(^*\): On the expressive power of monadic path logic ⋮ Unnamed Item ⋮ On Gabbay's temporal fixed point operator ⋮ On Monadic Theories of Monadic Predicates ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ Monoidal-closed categories of tree automata ⋮ Unnamed Item ⋮ Automata on infinite trees ⋮ Unambiguity in Automata Theory ⋮ Unnamed Item ⋮ Finite variability interpretation of monadic logic of order ⋮ Synthesis for continuous time

Cites Work

• Unnamed Item
• The monadic theory of order
• Modest theory of short chains. I

This page was built for publication: Rabin's uniformization problem