Tim French. Decidability of Quantifed Propositional Branching Time Logics. In Markus Stumptner, Dan Corbett, Michael J. Brooks, editors, AI 2001: Advances in Artificial Intelligence, 14th Australian Joint Conference on Artificial Intelligence, Adelaide, Australia, December 10-14, 2001, Proceedings. Volume 2256 of Lecture Notes in Computer Science, pages 165-176, Springer, 2001. [doi]
Abstract is missing.