Abstract
Kamp’s theorem states that the temporal logic with modalities Until and Since has the same expressive power as the First-Order Monadic Logic of Order (FOMLO) over Real and Natural time flows. Kamp notes that there are expressions which deserve to be regarded as tense operators but are not representable within FOMLO. The words ‘mostly’ and ‘usually’ are examples of such expressions. We propose a formalization of ‘usually’ as a generalized Mostowski quantifier and prove an analog of Kamp’s theorem.
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.
References
Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal logic: Mathematical Foundations and Computational Aspects. Oxford University Press (1994)
Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the Temporal Analysis of Fairness. In: POPL 1980, pp. 163–173 (1980)
Kamp, H.W.: Tense logic and the theory of linear order. Phd thesis, University of California, Los Angeles (1968)
Mostowski, A.: On a Generalization of Quantifiers. Fund. Math. 44, 12–36 (1957)
Pnueli, A.: The temporal logic of programs. In: Proc. IEEE 18th Annu. Symp. on Found. Comput. Sci., New York, pp. 46–57 (1977)
Rabinovich, A.: A proof of Kamp’s theorem. In: CSL 2012, pp. 516–527 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabinovich, A. (2013). An Unusual Temporal Logic. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-40313-2_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40312-5
Online ISBN: 978-3-642-40313-2
eBook Packages: Computer ScienceComputer Science (R0)