“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the First International Conference on Temporal Logic
ICTL '94 Proceedings of the First International Conference on Temporal Logic
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
BTL2 and the expressive power of ECTL+
Information and Computation
Comments on temporal logics for real-time system specification
ACM Computing Surveys (CSUR)
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A finite basis for ‘almost future' temporal logic over the reals
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Kamp's theorem states that there is a temporal logic with two modalities ("until" and "since") which is expressively complete for the first-order monadic logic of order over the real line. In this paper we show that there is no temporal logic with finitely many modalities which is expressively complete for the future fragment of first-order monadic logic of order over the real line (a future formula over the real time line is a formula whose truth value at a point is independent of what happened in the past).