Abstract
The intimate connection between first-order logic on automatic structures and MSO on (ω, < ) can be used to define generalized-automatic structures, which we introduced in section 1.5 as the ones that are MSO-to-FO interpretable in a tree. It is therefore a natural extension of the previous work to ask whether counting quantifiers preserve regularity on such generalized-automatic structures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kaiser, Ł. (2011). Cardinality Quantifiers in MSO on Linear Orders. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22807-0_6
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)