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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights 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