Skip to main content

Part of the book series: Macmillan Computer Science Series ((COMPSS))

  • 35 Accesses

Abstract

A set a collection of values called elements or members. The Z notation also uses the notion of type; all the possible values of a set are considered to have something in common, and are said to have the same type. Any set is therefore considered to be a subset of its type.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1991 David Lightfoot

About this chapter

Cite this chapter

Lightfoot, D. (1991). Sets in Z. In: Formal Specification Using Z. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-12144-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-12144-1_2

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-54408-2

  • Online ISBN: 978-1-349-12144-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics