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]
@inproceedings{French01,
title = {Decidability of Quantifed Propositional Branching Time Logics},
author = {Tim French},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2256/22560165.htm},
tags = {logic},
researchr = {https://researchr.org/publication/French01},
cites = {0},
citedby = {0},
pages = {165-176},
booktitle = {AI 2001: Advances in Artificial Intelligence, 14th Australian Joint Conference on Artificial Intelligence, Adelaide, Australia, December 10-14, 2001, Proceedings},
editor = {Markus Stumptner and Dan Corbett and Michael J. Brooks},
volume = {2256},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42960-3},
}