Lattices and Categories

P. M. Cohn
Additional contact information
P. M. Cohn: University College London, Department of Mathematics

Chapter 3 in Basic Algebra, 2003, pp 51-78 from Springer

Abstract: 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.

Keywords: Boolean Algebra; Distributive Lattice; Natural Transformation; Conjunctive Normal Form; Maximum Condition (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-85729-428-9_3

Ordering information: This item can be ordered from
http://www.springer.com/9780857294289

DOI: 10.1007/978-0-85729-428-9_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().