We give a linear-time algorithm to translate any formula from computation tree logic (CTL or CTL*) into an equivalent expression in a variable-connned fragment of transitive-closure logic FO(TC). Traditionally, CTL and CTL ? have been used to express queries for model checking and then translated into-calculus for symbolic evaluation. Evaluation of-calculus formulas is, however, complete for ti...