Abstract
The predicate calculus is adequate both for theoretical mathematics and for practical applications. Nevertheless, it is often useful to define systems of logic that are more convenient for specific tasks. This chapter studies a system for reasoning about time called temporal logic. Temporal logic is applicable in computer science, because the behavior of both hardware and software components is a function of time, unlike mathematical expressions such as 1 + 1 = 2 whose behavior (truth value) is static.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2001). Temporal Logic: Formulas, Models, Tableaux. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0335-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0335-6_11
Publisher Name: Springer, London
Print ISBN: 978-1-85233-319-5
Online ISBN: 978-1-4471-0335-6
eBook Packages: Springer Book Archive