Abstract
Let us next look at how relations are handled in higher-order logic. Relations, like predicates, form a complete Boolean lattice and thus have essentially the same set of inference rules as predicates. We can define new operations on relations, giving additional properties. In particular, relations combine a lattice and a category structure. Relations also provide us with a more expressive way of describing state changes, where the effect can be nondeterministic in some states and undefined in other states.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Back, RJ., von Wright, J. (1998). Relations. In: Refinement Calculus. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1674-2_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1674-2_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98417-9
Online ISBN: 978-1-4612-1674-2
eBook Packages: Springer Book Archive