Abstract
We consider the modal μ-calculus due to Kozen, which is a finitary modal logic with least and greatest fixed points of monotone operators. We extend the existing duality between the category of modal algebras with homomorphisms and the category of descriptive modal frames with contractions to the case of having fixed point, operators. As a corollary, we obtain a completeness result for Kozen's original system with respect to a certain class of modal frames.
Visiting Academic at the Department of Computing, Imperial College, London for the duration of the Nuffield Science Research Fellowship (SCI/124/528/G).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Fine. An incomplete logic containing S4. Theoria, 40:23–29, 1974.
N. Francez. Fairness Springer-Verlag, 1986.
G. Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen. North-Holland, 1969.
R. Goldblatt. Metamathematics of modal logic. Reports on Mathematical Logic, 6 and 7:41–78 and 21–52, 1976.
P. Halmos. Algebraic Logic. Chelsea, New York, 1962.
P. T. Johnstone. Stone Spaces. Cambridge University Press, 1982.
D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–353, 1983.
D. Kozen. A finite model theorem for the propositional μ-calculus. Studia Logica, 47:233–241, 1988.
M. Z. Kwiatkowska. Survey of fairness notions. Information and Software Technology, 31(7):371–386, 1989.
K. Larsen. Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science, 72, 1990.
J.-L. Lassez, V. Nguyen, and E. Sonenberg. Fixed point theorems and semantics: A folk tale. Information Processing Letters, 14(3):112–116. 1982.
D. Niwinski. On fixed-point clones. In L. Kott, editor, Automata. Languages and Programming, volume 226 of Lecture Notes in Computer Science Springer-Verlag, 1986.
D. Park. On the semantics of fair parallelism. In D. Bjorner, editor, Abstract Software Specifications, volume 86 of Lecture Notes in Computer Science, pages 504–526. Springer-Verlag, 1980.
G. Sambin and V. Vaccaro. Topology and duality in modal logic. Annals of Pure and Applied Logic, 37:249–296, 1988.
R. Sikorski. Boolean algebras. Springer-Verlag, third edition, 1969.
C. Stirling and D. Walker. Local model checking in the propositional μ-calculus. volume 351 of Lecture Notes in Computer Science, pages 369–383. Springer-Verlag, 1989.
S. Thomason. An incompleteness theorem in modal logic. Theoria, 40:30–34, 1974.
I. Walukiewicz. On the completeness of μ-calculus. To appear in LICS'93, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambler, S., Kwiatkowska, M., Measor, N. (1994). On duality for the modal μ-calculus. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049321
Download citation
DOI: https://doi.org/10.1007/BFb0049321
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58277-9
Online ISBN: 978-3-540-48599-5
eBook Packages: Springer Book Archive