Skip to main content
SpringerLink
Log in

Continuous Fragment of the mu-Calculus

  • Conference paper
Computer Science Logic (CSL 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5213))

Included in the following conference series:

Abstract

In this paper we investigate the Scott continuous fragment of the modal μ-calculus. We discuss its relation with constructivity, where we call a formula constructive if its least fixpoint is always reached in at most ω steps. Our main result is a syntactic characterization of this continuous fragment. We also show that it is decidable whether a formula is continuous.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Jung, A.: Domain Theory. In: Abramsky, S., Gabbay Dov, M., Maibaum, T.S.M. (eds.) Handbook for Logic in Computer Science. Clarendon Press, Oxford (1994)

    Google Scholar 

  2. Chang, C., Keisler, H.: Model Theory. North Holland, Amsterdam (1973)

    MATH  Google Scholar 

  3. D’Agostino, G., Hollenberg, M.: Logical Questions Concerning The mu-Calculus: Interpolation, Lyndon and Los-Tarski. Journal of Symbolic Logic, 310–332 (2000)

    Google Scholar 

  4. Hollenberg, M.: Logic and Bisimulation. PhD thesis, Utrecht University, Zeno Institute of Philosophy (1998)

    Google Scholar 

  5. van Benthem, J.: Exploring Logical Dynamics. CSLI Publications/Cambridge University Press (1996)

    Google Scholar 

  6. Janin, D., Walukiewicz, I.: Automata for the modal μ-calculus and related results. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552–562. Springer, Heidelberg (1995)

    Google Scholar 

  7. Gierz, G., Hofman, K., Keimel, K., Lawson, J., Mislove, M., Scott, D.: A Compendium of Continuous Lattices. Springer, Heidelberg (1980)

    MATH  Google Scholar 

  8. Otto, M.: Eliminating Recursion in the mu-Calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. van Benthem, J.: Modal Frame Correspondences and Fixed-Points. Studia Logica, 133–155 (2006)

    Google Scholar 

  10. Ikegami, D., van Benthem, J.: Modal Fixed-Point Logic and Changing Models. ILLC Preprint PP-2008-19 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Language and Computation, Plantage Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Gaëlle Fontaine

Authors
  1. Gaëlle Fontaine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Kaminski Simone Martini

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fontaine, G. (2008). Continuous Fragment of the mu-Calculus. In: Kaminski, M., Martini, S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87531-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87530-7

  • Online ISBN: 978-3-540-87531-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation