A Mu-Calculus

  • Chapter
Logic of Domains

Part of the book series: Progress in Theoretical Computer Science ((PTCS))

  • 54 Accesses

Abstract

The logical framework presented in the previous chapter is an axiomatization of the entailment on assertions using terms, types, and meta-predicates. These assertions were interpreted as compact open sets of the domains associated with the types. The expressive power of the logic is, therefore, not as strong as one sometimes would like. There is no assertion, for example, of the type of natural numbers to express ‘the set of even numbers’. To make the logic more expressive some extra structure on assertions is needed. One of the possible ways to get a richer assertion language is to introduce fixed-point operators.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 105.49
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 105.49
Price includes VAT (France)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Zhang, GQ. (1991). A Mu-Calculus. In: Logic of Domains. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0445-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0445-9_5

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6763-8

  • Online ISBN: 978-1-4612-0445-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation