Abstract
The subsets of a set permit operations quite similar to those performed on numbers. If for the moment we denote the union of two subsets A, B by A +B and their intersection by AB, a notation that will not be used later (despite some historical precedents), then we have laws like AB = BA, A(B + C) = AB + AC, similar to the familiar laws of arithmetic, as well as new laws such as A + A = A, A + BC = (A + B)(A + C). The algebra formed in this way is called a Boolean algebra, after George Boole who introduced it around the middle of the 19th century, and who made the interesting observation that Boolean algebras could also be used to describe the propositions of logic.
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
© 2003 Professor P.M. Cohn
About this chapter
Cite this chapter
Cohn, P.M. (2003). Lattices and Categories. In: Basic Algebra. Springer, London. https://doi.org/10.1007/978-0-85729-428-9_3
Download citation
DOI: https://doi.org/10.1007/978-0-85729-428-9_3
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1060-6
Online ISBN: 978-0-85729-428-9
eBook Packages: Springer Book Archive