Abstract
Let us begin with an informal discussion of the basic ideas already indicated in the introduction. The starting point of our considerations is the idea that there are different time points which may yield different truth values of propositions. We make a first important agreement: we assume the set of time points to be infinite, discrete and linearly ordered with a smallest element. This leads to the following picture of a time scale:
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kröger, F. (1987). Propositional Temporal Logic. In: Temporal Logic of Programs. EATCS Monographs on Theoretical Computer Science, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71549-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-71549-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-71551-8
Online ISBN: 978-3-642-71549-5
eBook Packages: Springer Book Archive