Abstract
With the time logic introduced in the previous chapter we have three languages for supporting programming theory. How are these languages related to each other? We show in the present chapter that time logic is the most powerful in expressive power. This will be shown by embedding the other two languages, i.e. temporal and dynamic logics, into time logic.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gergely, T., Úry, L. (1991). Expressive Power of Time Logic. In: First-Order Programming Theories. EATCS Monographs on Theoretical Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58205-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-58205-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63503-8
Online ISBN: 978-3-642-58205-9
eBook Packages: Springer Book Archive