An infinite hierarchy of temporal logics over branching time
Information and Computation
Why so Many Temporal Logics Climb up the Trees?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
On temporal logic versus datalog
Theoretical Computer Science - Logic and complexity in computer science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Automata logics, and infinite games
A unifying semantics for time and events
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
Modal Expressiveness of Graph Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Composition Theorem for Generalized Sum
Fundamenta Informaticae
A Temporal Logic for Stochastic Multi-Agent Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
How big must complete XML query languages be?
Proceedings of the 12th International Conference on Database Theory
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
The planning spectrum: one, two, three, infinity
Journal of Artificial Intelligence Research
Composition Theorems for Generalized Sum and Recursively Defined Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-checking games for fixpoint logics with partial order models
Information and Computation
Composition Theorem for Generalized Sum
Fundamenta Informaticae
| Hi-index | 0.00 |
We show that the expressive power of the branching time logic CTL coincides with that of the class of bisimulation invariant properties expressible in so-called monadic path logic: monadic second order logic in which set quantification is restricted to paths. In order to prove this result, we first prove a new Composition Theorem for trees. This approach is adapted from the approach of Hafer and Thomas in their proof that CTL coincides with the whole of monadic path logic over the class of full binary trees.