The aim of this study is to understand the inherent expressive power of CTL
operators. We investigate the complexity of model checking for all CTL
fragments with one CTL operator and arbitrary Boolean operators. This gives us
a fingerprint of each CTL operator. The comparison between the fingerprints
yields a hierarchy of the operators that mirrors their strength with respect to
model checking