Skip to main content

Relations

  • Chapter
Refinement Calculus

Part of the book series: Graduate Texts in Computer Science ((TCS))

  • 326 Accesses

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.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics