| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429163 | Information Processing Letters | 2008 | 5 Pages |
Abstract
We provide a conceptually simple and elementary proof of the exponential succinctness gap between the two branching time temporal logics CTL+ and CTL. It only uses CTL's small model property instead of automata- or game-theory and combinatorics as in previous proofs by Wilke and Adler/Immerman.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
