A Calculational Deductive System for Linear Temporal Logic

Abstract

This article surveys the linear temporal logic (LTL) literature and presents all the LTL theorems from the survey, plus many new ones, in a calculational deductive system. Calculational deductive systems, developed by Dijkstra and Scholten and extended by Gries and Schneider, are based on only four inference rules—Substitution, Leibniz, Equanimity, and Transitivity. Inference rules in the older Hilbert-style systems, notably modus ponens, appear as theorems in this calculational deductive system. This article extends the calculational deductive system of Gries and Schneider to LTL, using only the same four inference rules. Although space limitations preclude giving a proof of every theorem in this article, every theorem has been proved with calculational logic.

References

1. Roland Backhouse, D. Gries, W. M. Turski, and F. Dehne (Eds.). 1995. Special issue on the calculational method. Inf. Process. Lett. 53, 3 (1995).
2. Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. The MIT Press, Cambridge, MA.
3. Mordechai Ben-Ari. 2006. Principles of Concurrent and Distributed Programming (2nd ed.). Addison-Wesley Pearson, Harlow, England.
4. Mordechai Ben-Ari. 2012. Mathematical Logic for Computer Science (3rd ed.). Springer-Verlag, London.
5. Edward Cohen. 1990. Programming in the 1990’s: An Introduction to the Calculation of Programs. Springer-Verlag, New York.
6. Edsger W. Dijkstra. 1968. Letters to the editor: Go to statement considered harmful. Commun. ACM 11, 3 (Mar. 1968), 147--148. DOI:https://doi.org/10.1145/362929.362947
7. Edsger W. Dijkstra and Carel S. Scholten. 1990. Predicate Calculus and Program Semantics. Springer-Verlag, New York.
8. M. A. E. Dummett and E. J. Lemmon. 1959. Modal logics between S4 and S5. Zeitsch. Math. Logik Grund. Math. 5 (1959), 250--64.
9. Michael A. E. Dummett. 1978. Truth and Other Enigmas. Harvard University Press, Cambridge, MA.
10. E. Allen Emerson. 1990. Handbook of Theoretical Computer Science (Vol. B). The MIT Press, Cambridge, MA, Chapter: “Temporal and Modal Logic,” 995--1072. Retrieved from http://dl.acm.org/citation.cfm?id=114891.114907.
11. Wim H. H. Feijen. 1990. Exercises in formula manipulation. In Formal Development of Programs, E. W. Dijkstra (Ed.). Addison-Wesley, Menlo Park, NJ, 139--158.
12. David Gries. 1999. Monotonicity in calculational proofs. In Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the Occasion of His Retirement from His Professorship at the University of Kiel). Springer-Verlag, Berlin, 79--85. Retrieved from http://dl.acm.org/citation.cfm?id=646005.673872.
13. David Gries and Fred B. Schneider. 1994. A Logical Approach to Discrete Math. Springer-Verlag, New York.
14. David Gries and Fred B. Schneider. 1995. Equational propositional logic. Inform. Process. Lett. 53, 3 (1995), 145--152.
15. David Gries and Fred B. Schneider. 1995. A new approach to teaching discrete mathematics. PRIMUS 5, 2 (1995), 113--138. DOI:https://doi.org/10.1080/10511979508965779
16. David Gries and Fred B. Schneider. 1995. Teaching math more effectively, through calculational proofs. Amer. Math. Month. 102, 8 (1995), 691--697. Retrieved from http://www.jstor.org/stable/2974638.
17. David Gries and Fred B. Schneider. 1998. Adding the everywhere operator to propositional logic. J. Logic Comput. 8 (12 1998).
18. G. E. Hughes and M. J. Cresswell. 1996. A New Introduction to Modal Logic. Routledge, New York.
19. Anne Kaldewaij. 1990. Programming: The Derivation of Algorithms. Prentice-Hall International (UK) Ltd., Hertfordshire, UK.
20. Fred Kröger and Stephan Merz. 2008. Temporal Logic and State Systems. Springer-Verlag, Berlin.
21. Zohar Manna and Amir Pnueli. 1992. The Temporal Logic of Reactive and Concurrent Systems: v. 1, Specification. Springer-Verlag, New York.
22. Arthur N. Prior. 1967. Past, Present and Future. Oxford University Press.
23. Kenneth H. Rosen. 2007. Discrete Mathematics and Its Applications (6th ed.). McGraw-Hill, New York.
24. Fred B. Schneider. 1997. On Concurrent Programming. Springer-Verlag, New York.
25. George Tourlakis. 2001. On the soundness and completeness of equational predicate logics. J. Logic Comput. 11, 4 (2001), 623--653.

Index Terms

• Theory of computation

  • Logic

    • Modal and temporal logics