Abstract
We consider an extension of the guarded fragment in which one can guard quantifiers using the transitive closure of some binary relations. The obtained logic captures the guarded fragment with transitive guards, and in fact extends its expressive power non-trivially, preserving the complexity: we prove that its satisfiability problem is 2Exptime-complete.
Part of the M.Sc. thesis, under the supervision of Emanuel Kieroński.
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.
References
Andreka, H., Nemeti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217–274 (1998)
Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. In: Proceedings of the Ninth Annual ACM Symposium on theory of Computing, STOC 1977, Boulder, Colorado, United States, May 04 - 04, 1977, pp. 286–294. ACM, New York (1977)
Ganzinger, H., Meyer, C., Veanes, M.: The two-variable guarded fragment with transitive relations. In: Proc. LICS 1999. IEEE Computer Soc. Press, Los Alamitos (1999)
Grädel, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3(1), 53–69 (1997)
Grädel, E., Walukiewicz, I.: Guarded Fixed Point Logic. In: Proceedings of 14th IEEE Symposium on Logic in Computer Science LICS 1999, Trento (1999)
Grädel, E., Otto, M., Rosen, E.: Undecidability results on two-variable logics. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 249–260. Springer, Heidelberg (1997)
Grädel, E.: On the restraining power of guards. Journal of Symbolic Logic 64(4), 1719–1742 (1999)
Kazakov, Y.: Saturation-Based Decision Procedures for Extensions of the Guarded Fragment. PhD thesis, Universität des Saarlandes, Saarbrücken (March 2006)
Kieroński, E.: The two-variable guarded fragment with transitive guards is 2Exptime - Hard. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 299–312. Springer, Heidelberg (2003)
Scott, D.: A decision method for validity of sentences in two variables. J. Symb. Logic 27, 477 (1962)
Szwast, W., Tendera, L.: The guarded fragment with transitive guards. Annals of Pure and Applied Logic 128, 227–276 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michaliszyn, J. (2009). Decidability of the Guarded Fragment with the Transitive Closure. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-02930-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02929-5
Online ISBN: 978-3-642-02930-1
eBook Packages: Computer ScienceComputer Science (R0)