Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Logical Foundations of Computer Science

LFCS 1992: Logical Foundations of Computer Science — Tver '92 pp 382–393Cite as

Complete sequential calculi for the first order symmetrical linear temporal logic with until and since

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Abadi, Z.Manna, A timely resolution, First annual symposium on logic in Computer Science, (1987), 123–130.

    Google Scholar 

  2. H.Andreka, J.Nemeti, J.Sain, On the strength of temporal proofs, LNCS, Vol. 379, (1989), 135–144.

    Google Scholar 

  3. D.Gabbay, The declarative past and imperative future, Dep. of Comput. Imperial College, London (1989).

    Google Scholar 

  4. J.H.Gallier, Logic for computer Science: Foundations of Automatic Theorem Proving, Harper and Row, New York, 1986.

    Google Scholar 

  5. H.Kawai, Sequential calculus for a first order infinitary temporal logic, Zeitshr. für Math. Logic und Grundlagen der Math., Vol.33 (1987), 423–432.

    Google Scholar 

  6. Kroger, On interpretability of arithmetic in temporal logic, Theoret. Comput. Sci., Vol. 73, (1990), 47–60.

    Article  Google Scholar 

  7. G. Mints, Skolem's method of elimination of positive quantifiers in sequential calculi, Soviet Math. Dokl., Vol. 7, (1966), 861–864.

    Google Scholar 

  8. G. Mints, Herbrand's theorem for predicate calculus with equality and function symbols, Soviet Math. Dokl., Vol 7, (1966), 911–914.

    Google Scholar 

  9. R.Pliuškevičius, Investigation of finitary calculi for temporal logics by means of infinitary calculi, LNCS, Vol. 452, (1990), 464–469.

    Google Scholar 

  10. R.Pliuskevicius, Investigation of finitary calculus for a discrete linear time logic by means of finitary calculus, LNCS, Vol. 502, (1991), 504–528.

    Google Scholar 

  11. A.Szalas, L.Holenderski, Incompleteness of first-order temporal logic with UNTIL, Theoret. Comput. Sci, Vol.57, (1988), 317–325.

    Article  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

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pliuškevičius, R. (1992). Complete sequential calculi for the first order symmetrical linear temporal logic with until and since. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023891

Download citation

  • DOI: https://doi.org/10.1007/BFb0023891

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

  • Online ISBN: 978-3-540-47276-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation