Abstract
In this chapter, we extend the results on second-order cardinality quantifiers, shown for linear orders in the previous chapter, to trees. Our main result, obtained together with Vince Bárány and Alexander Rabinovich [8,9], is that the uncountability quantifier can be eliminated from MSO over trees.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kaiser, Ł. (2011). Cardinality Quantifiers in MSO on Trees. In: Logic and Games on Automatic Structures. Lecture Notes in Computer Science(), vol 6810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22807-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-22807-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22806-3
Online ISBN: 978-3-642-22807-0
eBook Packages: Computer ScienceComputer Science (R0)