Conference item

### Cardinality quantifiers in MLO over trees

Abstract:

We study an extension of monadic second-order logic of order with the uncountability quantifier there exist uncountably many sets''. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over finitely branching trees, which is notable for not all of these classes are analytic. Our approach...

### Authors

Publisher:
In Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic‚ CSL '09.
Volume:
5771
Host title:
LNCS
Publication date:
2009-01-01
UUID:
uuid:79c7c897-9463-4b69-99ec-dee5376f50ba
Local pid:
cs:3168
Deposit date:
2015-03-31