References

1. S. Ambler, M. Kwiatkowska & N. Measor (1995): Duality and the completeness of the modal μ-calculus. TCS 151, pp. 3–27, doi:10.1016/0304-3975(95)00045-X.
2. H. Andrèka, J. van Benthem, N. Bezhanishvili & I. Nèmeti (2014): Changing a semantics: opportunism or courage?. In: M. Manzano et al.: Life and work of Leon Henkin. Birkhäuser, pp. 307–337.
3. G. Bezhanishvili, N. Bezhanishvili & J. Harding (2015): Modal compact Hausdorff spaces. J. Logic Comput. 25(1), pp. 1–35, doi:10.1093/logcom/exs030.
4. N. Bezhanishvili, G. Fontaine & Y. Venema (2010): Vietoris Bisimulations. Journal of Logic and Computation 20(5), pp. 1017–1040, doi:10.1093/logcom/exn091.
5. N. Bezhanishvili & I. Hodkinson (2012): Preservation of Sahlqvist fixed point equations in completions of relativized fixed point BAOs. Algebra Universalis 68, pp. 43–56, doi:10.1007/s00012-012-0196-x.
6. N. Bezhanishvili & I. Hodkinson (2012): Sahlqvist theorem for modal fixed point logic. TCS 424, pp. 1–19, doi:10.1016/j.tcs.2011.11.026.
7. N. Bezhanishvili & S. Sourabh (2015): Sahlqvist preservation for topological fixed-point logic. J. Logic Comput., doi:10.1093/logcom/exv010..
8. P. Blackburn, M. de Rijke & Y. Venema (2001): Modal Logic. Cambridge University Press, doi:10.1017/CBO9781107050884.
9. B. ten Cate & G. Fontaine (2010): An easy completeness proof for the modal μ-calculus on finite trees. In: L. Ong: FOSSACS 2010, LNCS 6014. Springer, pp. 161–175, doi:10.1007/978-3-642-12032-9_12.
10. E.A. Emerson & C.S. Jutla (1991): Tree Automata, Mu-calculus and determinacy. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS'91). IEEE, pp. 368–377.
11. R. Goldblatt & I. Hodkinson (2016): Spatial logic of modal mu-calculus and tangled closure operators. Submitted.
12. E. Grädel, W. Thomas & T. Wilke (2002): Automata, Logic, and Infinite Games. LNCS 2500.
13. T. Henzinger (1996): The Theory of Hybrid Automata. In: LICS. IEEE, pp. 278–292, doi:10.1109/LICS.1996.561342.
14. D. Kozen (1983): Results on the propositional μ-calculus. TCS 27, pp. 333–353, doi:10.1016/0304-3975(82)90125-6.
15. C. Kupke, A. Kurz & Y. Venema (2004): Stone coalgebras. TCS 327(1-2), pp. 109–134, doi:10.1016/j.tcs.2004.07.023.
16. A. Mostowski (1991): Games with Forbidden Positions. Technical Report 78. Instytut Matematyki, Uniwersytet Gdański, Poland.
17. L. Santocanale (2008): Completions of μ-algebras. Annals of Pure and Applied Logic 154(1), pp. 27–50, doi:10.1016/j.apal.2007.11.001.
18. L. Santocanale & Y. Venema (2010): Completeness for flat modal fixpoint logics. Annals of Pure and Applied Logic 162(1), pp. 55–82, doi:10.1016/j.apal.2010.07.003.
19. R. Sikorski (1960): Boolean algebras. Erg. der Math. u. ihrer Grenzgeb. 25, doi:10.1007/978-3-662-01492-9.
20. R. Telgársky (1987): Topological games: On the 50th anniversary of the Banach-Mazur game. Rocky Mountain J. Math. 17, pp. 227–276, doi:10.1216/RMJ-1987-17-2-227.
21. Y. Venema (2004): A dual characterization of subdirectly irreducible BAOs. Studia Logica 77(1), pp. 105–115, doi:10.1023/B:STUD.0000034188.80692.46.
22. Y. Venema (2012): Lectures on the modal μ-calculus. Unpublished Manuscript. Available at https://staff.fnwi.uva.nl/y.venema/teaching/ml/mu/mu20121116.pdf.
23. I. Walukiewicz (2000): Completeness of Kozen's axiomatisation of the propositional μ-calculus. Information and Computation 157(1-2), pp. 142–182, doi:10.1006/inco.1999.2836. LICS 1995 (San Diego, CA).

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org