Weak MSO+U with Path Quantifiers over Infinite Trees
Logic in Computer Science
2014-04-30 v1
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.
Cite
@article{arxiv.1404.7278,
title = {Weak MSO+U with Path Quantifiers over Infinite Trees},
author = {Mikołaj Bojańczyk},
journal= {arXiv preprint arXiv:1404.7278},
year = {2014}
}
Comments
version of an ICALP 2014 paper with appendices