Skip to main content
SpringerLink
Log in

Decidable Cases of First-order Temporal Logic with Functions

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be decided with EXPSPACE-complete complexity. A single rigid function is sufficient to make the logic not recursively enumerable. However, the monadic monodic fragment with rigid functions, where no two distinct terms have variables bound by the same quantifier, is decidable and EXPSPACE-complete.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Degtyarev A., Fisher M., Lisitsa A. (2002) ‘Equality and monodic first-order temporal logic’. Studia Logica 72:147–156

    Article  Google Scholar 

  • Enderton, H., A Mathematical Introduction to Logic, Academic Press, 2001.

  • Börger, E., E. Gräel, and Y. Gurevich, The Classical Decision Problem, Springer, 1997.

  • Harel D. (1986) ‘Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness’. Journal of the ACM 33:224–248

    Article  Google Scholar 

  • Hodkinson, I., R. Kontchakov, A. Kurucz, F. Wolter, andM. Zakharyaschev, ‘On the computational complexity of decidable fragments of first-order linear temporal logics’, Proceedings TIME-ICTL’03, IEEE Computer Society Press, 2003, pp. 91–98.

  • Hodkinson I., Wolter F., Zakharyaschev M. (2000) ‘Decidable fragments of firstorder temporal logics’. Annals of Pure and Applied Logic 106:85–134

    Article  Google Scholar 

  • Hodkinson I. (2002) ‘Monodic packed fragment with equality is decidable’. Studia Logica 72:185–197

    Article  Google Scholar 

  • Shostak R. (1979) ‘A practical decision procedure for arithmetic with function symbols’. Journal of the ACM 26:351–360

    Article  Google Scholar 

  • Valencia F. (2005) ‘Decidability of infinite-state timed CCP processes and first-order LTL’. Theoretical Computer Science 330:577–607

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Loughborough University, Loughborough, LE11 3TU, UK

    Walter Hussak

Authors
  1. Walter Hussak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Walter Hussak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hussak, W. Decidable Cases of First-order Temporal Logic with Functions. Stud Logica 88, 247–261 (2008). https://doi.org/10.1007/s11225-008-9104-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-008-9104-y

Keywords

Search

Navigation