2000 character limit reached
Weak MSO+U with Path Quantifiers over Infinite Trees (1404.7278v1)
Published 29 Apr 2014 in cs.LO
Abstract: This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain automaton model, while emptiness for the automaton model is decided using profinite trees.