Eiter, ThomasThomasEiterGottlob, GeorgGeorgGottlobGurevich, YuriYuriGurevich2022-09-121998-07-082022-09-121997http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-257https://jlupub.ub.uni-giessen.de/handle/jlupub/7563http://dx.doi.org/10.22029/jlupub-6997Existential second­order logic (ESO) and monadic second­order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ESO over strings, (i.e., finite word structures). Moreover, we determine the complexity of model checking over strings, for all ESO­prefix classes. Let ESO(Q) denote the prefix class containing all sentences of the shape 9RQ' where R is a list of predicate variables, Q is a first­order quantifier prefix from the prefix set Q, and ' is quantifier free. We show that ESO(9 \Lambda 89 \Lambda ) and ESO(9 \Lambda 88) are the maximal standard ESO­prefix classes contained in MSO, thus expressing only regular languages. We further prove the following dichotomy theorem: An ESO prefix­class either expresses only regular languages (and is thus in MSO), or it expresses some NP­complete languages. We also give a precise characterization of those ESO­prefix classes which are equivalent to MSO over strings, and of the ESO­prefix classes which are closed under complementation on strings.enIn Copyrightddc:004