Skip to main content
SpringerLink
Log in

On the completeness and decidability of a restricted first order linear temporal logic

  • Contributed Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1997)

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

Included in the following conference series:

Abstract

The paper describes a class of FC-sequents of a restricted first order linear temporal logic with “next” and “always”. It is shown that the first order linear temporal logic is finitary complete for FC-sequents. If FC-sequents are logically decidable, i.e., all sequents, constructed from all possible subformulas of logical formulas of FC-sequents are decidable in first-order logic, then FC-sequents are decidable in the restricted first order linear temporal logic. To obtain these results a saturation calculus [6, 7] for FC-sequents is constructed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Andreka, J. Nemeti, J. Sain: On the strenghth of temporal proof. LNCS 379 (1989) 135–144

    Google Scholar 

  2. K.R. Apt: On the unification free Prolog programs. LNCS 711 (1993) 1–19

    Google Scholar 

  3. M. Fisher: A normal form for first order temporal formulae. LNCS 607 (1992) 370–384

    Google Scholar 

  4. H. Kawai: Sequential calculus for a first order infinitary temporal logic. Zeitchr. fur Math. Logic and Grundlagen der Math. 33 (1987) 423–452

    Google Scholar 

  5. S. Merz: Decidability and incompleteness results for first order temporal logics of linear time. Journal of Applied Noc-Classical Logics 2 (1992) 139–156

    Google Scholar 

  6. R. Pliuskevicius: On saturated calculi for a linear temporal logic. LNCS 711 (1993) 640–649

    Google Scholar 

  7. R. Pliuskevicius: The saturated tableaux for linear miniscoped Horn-like temporal logic. Journal of Automated Reasoning 13 (1994) 51–67

    Google Scholar 

  8. A. Szalas: Concerning the semantic consequence relation in first-order temporal logic. Theoret. Comput. Sci. 47 (1986) 329–334

    Google Scholar 

  9. A. Szalas: A complete axiomatic characterization of first-order temporal logic of linear time. Theoret. Comp. Sci. 54 (1987) 199–214

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Akademijos 4, 2600, Vilnius, Lithuania

    Regimantas Pliuškevičius

Authors
  1. Regimantas Pliuškevičius
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pliuškevičius, R. (1997). On the completeness and decidability of a restricted first order linear temporal logic. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-63385-5_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63385-3

  • Online ISBN: 978-3-540-69806-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation