Search results
Results: 8
Number of items: 8
-
Fontaine, G., & Venema, Y. (2018). Some model theory for the modal μ-calculus: Syntactic characterisations of semantic properties. Logical Methods in Computer Science, 14(1), Article 14. https://doi.org/10.23638/LMCS-14(1:14)2018 -
Bezhanishvili, N., Fontaine, G., & Venema, Y. (2010). Vietoris bisimulations. Journal of Logic and Computation, 20(5), 1017-1040. https://doi.org/10.1093/logcom/exn091
-
ten Cate, B., & Fontaine, G. (2010). An easy completeness proof for the modal μ-calculus on finite trees. In R. Matthes, & T. Uustalu (Eds.), 6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings (pp. 30-38). Tallinn University of Technology, Institute of Cybernetics. http://cs.ioc.ee/fics09/fics09proc.pdf
-
Fontaine, G., Leal, R., & Venema, Y. (2010). Automata for Coalgebras: an approach using predicate liftings. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, & P. G. Spirakis (Eds.), Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings (Vol. 2, pp. 381-392). (Lecture Notes in Computer Science; Vol. 6199), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-642-14162-1_32
-
Fontaine, G. (2008). Continuous Fragment of the mu-Calculus. In M. Kaminski, & S. Martini (Eds.), Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008 : proceedings (pp. 139-153). (Lecture Notes in Computer Science; Vol. 5213). Springer. https://doi.org/10.1007/978-3-540-87531-4_12
-
Fontaine, G. (2006). ML is not finitely axiomatizable over Cheq. In G. Governatori, I. Hodkinson, & Y. Venema (Eds.), Advances in Modal Logic 6 (pp. 139-146). College Publications. http://www.aiml.net/volumes/volume6/
Page of