An Easy Completeness Proof for the Modal ::::µ::::-Calculus on Finite Trees

Balder ten Cate, Gaëlle Fontaine. An Easy Completeness Proof for the Modal ::::µ::::-Calculus on Finite Trees. In C.-H. Luke Ong, editor, Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Volume 6014 of Lecture Notes in Computer Science, pages 161-175, Springer, 2010. [doi]

Abstract

Abstract is missing.