Abstract
Boolean algebra was introduced in \(1854\) by George Boole and has been very important for the development of computer science. It operates with variables which have the truth values true and false (sometimes denoted 1 and 0 respectively). In this chapter the main operations of Boolean algebra (conjunction (AND, \(\wedge \)), disjunction (OR, \(\vee \)) and negation (NOT, \(\lnot \))) are defined, and statements involving logical variables are studied with the aid of truth tables and Venn diagrams. Useful formulae involving logical variables are then discussed (De Morgan’s laws), along with the existential and universal quantifiers and their negation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 The Author(s)
About this chapter
Cite this chapter
Bagdasar, O. (2013). Boolean Algebra, Logic and Quantifiers. In: Concise Computer Mathematics. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-01751-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-01751-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01750-1
Online ISBN: 978-3-319-01751-8
eBook Packages: Computer ScienceComputer Science (R0)