Abstract
Graph Logic, a query language being a sublogic of Monadic Second Order Logic is studied in [CGG02]. In the paper [DGG04] the expressiveness power of Graph Logic is examined, and it is shown, for many MSO properties, how to express them in Graph Logic. But despite of the positive examples, it is conjectured there that Graph Logic is strictly less expressive than MSO Logic. Here we give a proof of this conjecture.
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.
Similar content being viewed by others
References
Ajtai, M., Fagin, R., Stockmeyer, L.: The Closure of Monadic \(\cal NP\). In: Proc. of 13th STOC, pp. 309–318 (1998)
Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 597–610. Springer, Heidelberg (2002)
Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. 2, pp. 194–242. Elsevier Science Publishers, Amsterdam (1990)
Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and Complexity of Graph Logic, Imperial College, Department of Computing Technical Report 2004/3, Information and Computation (to appear)
Ebinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)
Grohe, M., Schweikardt, N.: Comparing the succinctness of monadic query languages over finite trees. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 226–240. Springer, Heidelberg (2003)
Janin, D., Marcinkowski, J.: A Toolkit for First Order Extensions of Monadic Games. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 353–364. Springer, Heidelberg (2001)
Keisler, H.J., Lotfallah, W.B.: First order quantifiers in monadic second order logic. J. Symbolic Logic 69(1), 118–136 (2004)
Marcinkowski, J.: Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraisse games. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 338–349. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marcinkowski, J. (2006). On the Expressive Power of Graph Logic. In: Ésik, Z. (eds) Computer Science Logic. CSL 2006. Lecture Notes in Computer Science, vol 4207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11874683_32
Download citation
DOI: https://doi.org/10.1007/11874683_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45458-8
Online ISBN: 978-3-540-45459-5
eBook Packages: Computer ScienceComputer Science (R0)