Skip to main content
Springer Nature Link
Log in

EXPSPACE-Complete Variant of Guarded Fragment with Transitivity

(Extended Abstract)

  • Conference paper
  • First Online:
STACS 2002 (STACS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2285))

Included in the following conference series:

  • 633 Accesses

Abstract

We introduce a new fragment GF 2 + \( \overrightarrow {TG} \) of the first order logic — the two-variable guarded fragment with one-way transitive guards. This logic corresponds in a natural way to temporal logics without past operators. We prove that the satisfiability problem for GF+\( \overrightarrow {TG} \) is EXPSPACE-complete. The lower bound, obtained for the monadic version of the considered logic without equality, improves NEXPTIME lower bound for the whole two-variable guarded fragment with transitive guards GF 2 + TG, given by Szwast and Tendera [8].

Supported by KBN grant 8 T11C 043 19

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. H. Andréka, J. van Benthem, I. Németi, Modal Languages and Bounded Fragments of Predicate Logic, ILLC Research Report, 1996.Journal ver.: J. Philos. Logic, 27 (1998), No.3, 217–274.

    Article  MATH  Google Scholar 

  2. J. Balcázar, J. Diaz, J. Gabarró, Structural Complexity II, Springer 1990.

    Google Scholar 

  3. A. Chandra, D. Kozen, L. Stockmeyer, Alternation, JACM, 28, No.1 (1981), pages 114–133.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Ganzinger, C. Meyer, M. Veanes The Two-Variable Guarded Fragment with Transitive Relations, Proc. of 14-th IEEE Symp. on Logic in Computer Science, pages 24–34, 1999.

    Google Scholar 

  5. E. Grädel, On the restraining power of guards, Journal of Symbolic Logic 64:1719–1742, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Grädel, P. Kolaitis, M. Vardi, On the decision problem for two-variable first order logic, Bull. of Symbolic Logic, 3(1):53–96, 1997.

    Article  MATH  Google Scholar 

  7. E. Grädel, I. Walukiewicz, Guarded Fixpoint Logic, Proc. of 14th IEEE Symp. on Logic in Computer Science, pages 45–54, 1999.

    Google Scholar 

  8. W. Szwast, L. Tendera On the decision problem for the guarded fragment with transitivity, Proc. of 16-th IEEE Symp. on Logic in Computer Science, pages 147–156, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Wrocław

    Emanuel Kieroński

Authors
  1. Emanuel Kieroński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kieroński, E. (2002). EXPSPACE-Complete Variant of Guarded Fragment with Transitivity. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics