“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of theoretical computer science (vol. B)
An infinite hierarchy of temporal logics over branching time
Information and Computation
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time
POPL '81 Proceedings of the 8th 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
On the Expressive Power of Modal Logics on Trees
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
BTL2 and the expressive power of ECTL+
Information and Computation
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
| Hi-index | 5.23 |
A major result concerning temporal logics is Kamp's Theorem which states that the pair of modalities ''until'' and ''since'' is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals. The paper concerns the expressive power of temporal logics over trees. The main result states that in contrast to Kamp's Theorem, for every n there is a modality of arity n definable by a monadic logic formula, which is not equivalent over trees to any temporal logic formula which uses modalities of arity less than n. Its proof takes advantage of an instance of Shelah's composition theorem.This result has interesting corollaries, for instance reproving that CTL^* and ECTL^+ have no finite basis.