Abstract
In everyday English, the word ‘set’ is used in phrases such as ‘a set of spanners’, ‘a geometry set’ or ‘a set of rules’ and similarly, in mathematics and computing, a set is simply a collection of objects of the same type. One way of defining a set is to list all members or elements of that set. For example,
{Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday}
is the set of the days of the week. When defining a set by listing its elements, the elements themselves are separated by commas and the total collection of elements is surrounded by special parentheses, { and }. The order of the elements is unimportant and each element must only be listed once. Two sets are equal if and only if they contain exactly the same elements.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1995 G.P. McKeown and V.J. Rayward-Smith
About this chapter
Cite this chapter
McKeown, G.P., Rayward-Smith, V.J. (1995). Fundamentals. In: Mathematical Foundations for Computing. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-10719-3_1
Download citation
DOI: https://doi.org/10.1007/978-1-349-10719-3_1
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-48855-3
Online ISBN: 978-1-349-10719-3
eBook Packages: EngineeringEngineering (R0)