Abstract
This chapter defines the deductive system \( L \) for linear temporal logic. We will prove many of the formulas presented in the previous chapter, as well as the soundness and completeness of \( L \).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Informatica, 20:207–226, 1983.
F. Kröger and S. Merz. Temporal Logic and State Systems. Springer, 2008.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Vol. I: Specification. Springer, New York, NY, 1992.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Vol. II: Safety. Springer, New York, NY, 1995.
Z. Manna and A. Pnueli. Temporal verification of reactive systems: Progress. Draft available at http://www.cs.stanford.edu/~zm/tvors3.html , 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2012). Temporal Logic: A Deductive System. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4129-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4129-7_14
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4128-0
Online ISBN: 978-1-4471-4129-7
eBook Packages: Computer ScienceComputer Science (R0)