Editing Computation tree logic (section)

==Relations with other logics==
<!-- CTL is a subset of CTL* -->
Computation tree logic (CTL) is a subset of CTL* as well as of the [[modal mu calculus|modal μ calculus]]. CTL is also a fragment of Alur, Henzinger and Kupferman's [[alternating-time temporal logic]] (ATL).

<!-- CTL is complementary to LTL -->
Computation tree logic (CTL) and [[linear temporal logic]] (LTL) are both a subset of CTL*. CTL and [[Linear temporal logic|LTL]] are not equivalent and they have a common subset, which is a proper subset of both CTL and LTL.
*'''FG'''.P exists in LTL but not in CTL.
*'''AG'''(P⇒(('''EX'''.Q)&and;('''EX'''¬Q))) and '''AG.EF'''.P exist in CTL but not in LTL.