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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
