Skip to main content
SpringerLink
Log in

Design complete sequential calculus for continuous fixpoint temporal logic

  • Conference paper
  • First Online:
Logics in AI (JELIA 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 633))

Included in the following conference series:

  • 265 Accesses

Abstract

We present the method for design complete sequential calculus for continuous fixpoint temporal logic. The method relies on reduction of infinitary calculus for temporal logic under consideration to finitary one. As result of the reduction we can prove completeness and obtain the cut-free sequential calculus for temporal logic under consideration. The reduction present some way for searching so called invariant formulas.

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. B.Baniegbal, H.Barringer: Temporal logic with fixed points. LNCS, Vol. 398, (1987), 62–74.

    Google Scholar 

  2. H.Barringer: The use of temporal logic in the compositional specification of concurrent systems. In A.Galton (ed.): Temporal logics and their applications. Academic Press, London, (1987). 53–90.

    Google Scholar 

  3. J.H.Gallier: Logic for computer Science: foundations of automatic theorem proving. Harper and Row, New York, (1986).

    Google Scholar 

  4. A.Galton: Temporal logic and computer science: an overview. In A.Galton (ed.): Temporal logics and their applications. Academic Pres, London, (1987), 1–52.

    Google Scholar 

  5. D.Park: Fixpoint induction and proofs of program properties. Machine Intelligence 5, Edinburgh University Press, (1969), 59–78.

    Google Scholar 

  6. D.Park: Finiteness is mu-ineffable. Theor. Comp. Sci, 3, (1976), 173–181.

    Article  Google Scholar 

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

    Google Scholar 

  8. R.Pliuškevičius: Investigation of finitary calculus for a discrete linear time logic by means of finitary calculus. LNCS, Vol. 502, (1991), 504–528.

    Google Scholar 

  9. R.Pliuškevičius: Complete sequential calculi for the first order symmetrical linear temporal logic with UNTIL and SINCE. LNCS, Proc. of LFCS' 92 (in press).

    Google Scholar 

  10. M.Vardi: A temporal fixpoint calculus. Proc. of 15-th An. ACM Symp. on POPL (1988), 250–259.

    Google Scholar 

  11. P.Wolper: Temporal logic can be more expressive. Information and Control, 56, (1983), 72–99.

    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

D. Pearce G. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pliuškevičius, R. (1992). Design complete sequential calculus for continuous fixpoint temporal logic. In: Pearce, D., Wagner, G. (eds) Logics in AI. JELIA 1992. Lecture Notes in Computer Science, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023420

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation