[1]

Mark Reynolds.
A tableau for CTL*.
In Ana Cavalcanti and Dennis Dams, editors, FM, volume 5850 of
Lecture Notes in Computer Science, pages 403418. Springer, 2009.
[ bib ]

[2]

D.M. Gabbay, I. Hodkinson, M.A. Reynolds, and M. Finger.
Temporal logic: mathematical foundations and computational
aspects.
Oxford University Press, USA, 2000.
[ bib ]

[3]

Mark Reynolds.
An axiomatization of full computation tree logic.
J. Symb. Log., 66(3):10111057, 2001.
[ bib ]

[4]

Mark Reynolds.
The complexity of the temporal logic with "until" over general linear
time.
J. Comput. Syst. Sci., 66(2):393426, 2003.
[ bib ]

[5]

T.N. French.
Bisimulation quantifiers for modal logics.
2006.
[ bib ]

[6]

Tim French, John Christopher McCabeDansted, and Mark Reynolds.
A temporal logic of robustness.
In Boris Konev and Frank Wolter, editors, FroCos, volume 4720
of Lecture Notes in Computer Science, pages 193205. Springer, 2007.
[ bib ]
