On the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow some extra monadic predicates on the nodes. We show that this class equals to the Boolean combinations of sets in the Borel class Sigma(0)(2) over the Cantor discontinuum. Note that the last coincides with the Borel complexity of omega-regular languages.
trees monadic 2nd-order logic infinite words borel hierarchy automata