On the Decidability of MSO+U on Infinite Trees

DOI10.1007/978-3-662-43951-7_5zbMath1407.03007OpenAlexW145105541MaRDI QIDQ5167826

Henryk Michalewski, Michał Skrzypczak, Tomasz Gogacz, Mikołaj Bojańczyk

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43951-7_5

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Consistency and independence results (03E35)

Related Items (5)

Measure Quantifier in Monadic Second Order Logic ⋮ Asymptotic Monadic Second-Order Logic ⋮ Delay Games with WMSO$$+$$U Winning Conditions ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Contribution of Warsaw logicians to computational logic

This page was built for publication: On the Decidability of MSO+U on Infinite Trees