Abstract
We show that the modal μ-calculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [4]. Further, we introduce the modal μ ~-calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus over GL collapses to the modal fragment, too. The latter result allows us a new proof of the de Jongh, Sambin Theorem and provides a simple algorithm to construct the fixpoint formula.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alberucci, L., A Syntactical Treatment of Simultaneous Fixpoints in the Modal μ- Calculus, Technical Report, University of Berne, 2008.
Alberucci, L., and A. Facchini, ‘The Modal μ-Calculus Hierarchy on Restricted Classes of Transition Systems’. Submitted.
Alberucci, L., and J. Krähenbühl, ‘Justifying Induction on Modal μ-Formulae’. In Preparation.
van Benthem J. (2006) ‘Modal Frame Correspondences and Fixed-Points’. Studia Logica 83: 133–155
Bernardi C. (1976) ‘The Uniqueness of the Fixed Point in Every Diagonalizable Algebra’. Studia Logica 35: 335–343
Boolos, G., The Logic of Provability, Cambridge University Press, 1993.
Blackburn, P., de Rijke M. and Y. Venema, Modal Logic, Cambridge University Press, 2001.
Bradfield J., Stirling C. (2001) ‘Modal Logic and Mu-Calculi’. In: Bergstra J., Ponse A., Smolka S.(eds) Handbook of Process Algebra. Elsevier, North-Holland, pp 293–332
Emerson, E.A., and C. S. Jutla, ‘Tree Automata, Mu-Calculus and Determinacy’ (Extended Abstract), FOCS 1991: 368–377, 1991.
Kozen D. (1983) ‘Results on the Propositional Mu-Calculus’. Theoretical Computer Science 27: 333–354
Scott, D., and J. De Bakker, A Theory of Programs. Unpublished manuscript, IBM, Vienna, 1969.
Stirling, C., Modal and Temporal Properties of Processes, Springer-Verlag Berlin Heidelberg, 2001.
Streett R.S., Emerson E.A. (1989) ‘An Automata Theoretic Decision Procedure for the Propositional μ-Calculus’. Information and Computation 81(3): 249–264
Mostowski, A.W., ‘Games with Forbidden Position’, Technical Report 78, University of Gdansk, 1991.
Smorynski, C., Self-Reference and Modal Logic, Springer-Verlag, 1985.
Tarski A. (1955) ‘A Lattice-Theoretical Fixpoint Theorem and its Applications’. Pacific Journal of Mathematics 5(2): 285–309
Visser, A., ‘Löb’s Logic Meets the μ-Calculus’, in A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. de Vrijer (eds.), Processes, Terms and Cycles, Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, Berlin, Springer, 2005, pp. 14–25.
Walukiewicz I. (2000) ‘Completeness of Kozen’s Axiomatisation of the Propositional Mu-Calculus’. Information and Computation 157: 142–182
Wilke T. (2001) ‘Alternating Tree Automata, Parity Games, and Modal Mu-Calculus’. Bul. Belg. Math. Soc. 8(2): 359–391
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by Melvin Fitting
Rights and permissions
About this article
Cite this article
Alberucci, L., Facchini, A. On Modal μ-Calculus and Gödel-Löb Logic. Stud Logica 91, 145–169 (2009). https://doi.org/10.1007/s11225-009-9170-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-009-9170-9