Abstract
The present paper gives a classification of the expressive power of two-variable least fixed-point logics. The main results are:
-
1
The two-variable fragment of monadic least fixed-point logic with parameters is as expressive as full monadic least fixed-point logic (on binary structures).
-
2
The two-variable fragment of monadic least fixed-point logic without parameters is as expressive as the two-variable fragment of binary least fixed-point logic without parameters.
-
3
The two-variable fragment of binary least fixed-point logic with parameters is strictly more expressive than the two-variable fragment of monadic least fixed-point logic with parameters (even on finite strings).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnold, A., Niwiński, D.: Rudiments of μ-calculus. North Holland, Amsterdam (2001)
Cosmadakis, S.S.: The complexity of evaluating relational queries. Information and Control 58, 101–112 (1983)
Dawar, A.: Feasible computation through model theory. PhD thesis, Univ. of Pennsylvania (1993)
Dawar, A., Lindell, S., Weinstein, S.: Infinitary logic and inductive definability over finite structures. Information and Computation 119, 160–175 (1995)
Dawar, A., Grädel, E., Kreutzer, S.: Inflationary fixed points in modal logic. ACM Transactions on Computational Logic 5, 282–315 (2004)
Dziembowski, S.: Bounded-variable fixpoint queries are pspace-complete. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 89–105. Springer, Heidelberg (1997)
Ebbinghaus, H.-D., Flum, J.: Finite model theory, 2nd edn. Springer, New York (1999)
Grädel, E., Otto, M.: On Logics with Two Variables. Theoretical Computer Science 224, 73–113 (1999)
Grädel, E., Otto, M., Rosen, E.: Undecidability Results for Two-Variable Logics. Archive for Mathematical Logic 38, 313–354 (1999) (Journal version of STACS 1997 paper)
Grohe, M.: Finite variable logics in descriptive complexity theory. Bulletin of Symbolic Logic 4, 345–398 (1998)
Grohe, M., Schweikardt, N.: Comparing the succinctness of monadic query languages over finite trees. RAIRO - Theoretical Informatics and Applications (ITA) 38, 343–373 (2004); Journal version of CSL 2003 paper
Hodkinson, I.: Finite variable logics. Bull. Europ. Assoc. Theor. Comp. Sci. 51, 111–140 (1993)
Immerman, N.: Relational queries computable in polynomial time. Information and Control 68, 86–104 (1986)
Kolaitis, P., Vardi, M.: On the expressive power of variable-confined logics. In: Proc. of LICS 1996, pp. 348–359 (1996)
Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)
Otto, M.: Bounded variable logics and counting – A study in finite models. Lecture Notes in Logic, vol. 9, p. IX+183. Springer, Heidelberg (1997)
Schweikardt, N.: On the expressive power of monadic least fixed point logic. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1123–1135. Springer, Heidelberg (2004)
Vardi, M.Y.: On the complexity of bounded-variable queries. In: PODS 1995: 14th ACM Symposium on Principles of Database Systems, pp. 266–276 (1995)
Vardi, M.Y.: The complexity of relational query languages. In: STOC 1982: 14th Annual ACM Symposium on the Theory of Computing, pp. 137–146 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grohe, M., Kreutzer, S., Schweikardt, N. (2005). The Expressive Power of Two-Variable Least Fixed-Point Logics. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_37
Download citation
DOI: https://doi.org/10.1007/11549345_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)