Boolean Algebra Report PDF

REPORT TITLE:
Boolean Algebra
2019-2020
College of Engineering
Mustansiriyah University
Department: Computer Engineering Department

1st Student Name: ‫حيدر عبد الحكيم مزهر‬
2nd Student Name: ‫محمد حسن حيدر محمد‬
Stage: First stage
Study: Evening
Class: one
Course Name: second course
1st Email: haydarx030@gmail.com
2nd Email: moh07.10h@gmail.com
Page 1 of 11
: :‫القسم‬ ‫كلية الهندسة – الجامعة المستنصرية‬
‫الشعبة‬ ‫المرحلة‬ :‫االسم‬
What Is Boolean Algebra?

Boolean algebra is a division of mathematics that deals with operations on logical values
and incorporates binary variables. Boolean algebra traces its origins to an 1854 book by
mathematician George Boole.
The distinguishing factor of Boolean algebra is that it deals only with the study of binary
variables. Most commonly Boolean variables are presented with the possible values of 1
("true") or 0 ("false"). Variables can also have more complex interpretations, such as in set
theory. Boolean algebra is also known as binary algebra.
Understanding Boolean Algebra

Boolean algebra is different from elementary algebra as the latter deals with numerical
operations and the former deals with logical operations. Elementary algebra is expressed
using basic mathematical functions, such as addition, subtraction, multiplication, and
division, whereas Boolean algebra deals with conjunction, disjunction, and negation.
The concept of Boolean algebra was first introduced by George Boole in his book, The
Mathematical Analysis of Logic, and further expanded upon in his book, An Investigation of
the Laws of Thought. Since its concept has been detailed, Boolean algebra's primary use
has been in computer programming languages. Its mathematical purposes are used in set
theory and statistic.
Laws of Boolean Algebra
Boolean Algebra uses a set of Laws and Rules to define the operation of a digital logic
circuit.
As well as the logic symbols “0” and “1” being used to represent a digital input or output,
we can also use them as constants for a permanently “Open” or “Closed” circuit or
contact respectively.
A set of rules or Laws of Boolean Algebra expressions have been invented to help
reduce the number of logic gates needed to perform a particular logic operation resulting
in a list of functions or theorems known commonly as the Laws of Boolean Algebra.
Boolean Algebra is the mathematics we use to analyse digital gates and circuits. We
can use these “Laws of Boolean” to both reduce and simplify a complex Boolean
expression in an attempt to reduce the number of logic gates required. Boolean
Page 2 of 11
Algebra is therefore a system of mathematics based on logic that has its own set of rules
or laws which are used to define and reduce Boolean expressions.
The variables used in Boolean Algebra only have one of two possible values, a logic “0”
and a logic “1” but an expression can have an infinite number of variables all labelled
individually to represent inputs to the expression, For example, variables A, B, C etc,
giving us a logical expression of A + B = C, but each variable can ONLY be a 0 or a 1.
Examples of these individual laws of Boolean, rules and theorems for Boolean Algebra
are given in the following table.
Truth Tables for the Laws of Boolean
Boolean Equivalent Boolean Algebra

Description
Expression Switching Circuit Law or Rule
A in parallel with
A+1=1 Annulment
closed = “CLOSED”
A in parallel with
A+0=A Identity
open = “A”
A in series with
A.1=A Identity
closed = “A”
A in series with
A.0=0 Annulment
open = “OPEN”
Page 3 of 11
A in parallel with
A+A=A Idempotent
A = “A”
A in series with
A.A=A Idempotent
A = “A”
NOT NOT A
NOT A = A Double Negation
(double negative) = “A”
A in parallel with
A+A=1 NOT A = “CLOSED”
Complement
A in series with
A.A=0 NOT A = “OPEN”
Complement
A in parallel with B =
A+B = B+A Commutative
B in parallel with A
A in series with B =
A.B = B.A Commutative
B in series with A
A+B = A.B invert and replace OR with AND de Morgan’s Theorem
Page 4 of 11
A.B = A+B invert and replace AND with OR de Morgan’s Theorem
The basic Laws of Boolean Algebra that relate to the Commutative Law allowing a
change in position for addition and multiplication, the Associative Law allowing the
removal of brackets for addition and multiplication, as well as the Distributive
Law allowing the factoring of an expression, are the same as in ordinary algebra.
Each of the Boolean Laws above are given with just a single or two variables, but the
number of variables defined by a single law is not limited to this as there can be an
infinite number of variables as inputs too the expression. These Boolean laws detailed
above can be used to prove any given Boolean expression as well as for simplifying
complicated digital circuits.
A brief description of the various Laws of Boolean are given below with A representing
a variable input.
Description of the Laws of Boolean Algebra
 Annulment Law – A term ANDéd with a “0” equals 0 or ORéd with a “1” will equal 1

o A.0=0 A variable AND’ed with 0 is always equal to 0

o A + 1 = 1 A variable OR’ed with 1 is always equal to 1

 Identity Law – A term ORéd with a “0” or ANDéd with a “1” will always equal that
term

o A + 0 = A A variable OR’ed with 0 is always equal to the variable

o A.1=A A variable AND’ed with 1 is always equal to the variable

 Idempotent Law – An input that is ANDéd or ORéd with itself is equal to that input

o A+A=A A variable OR’ed with itself is always equal to the variable
Page 5 of 11
o A.A=A A variable AND’ed with itself is always equal to the variable


 Complement Law – A term ANDéd with its complement equals “0” and a term ORéd
with its complement equals “1”

o A.A=0 A variable AND’ed with its complement is always equal to 0

o A+A=1 A variable OR’ed with its complement is always equal to 1

 Commutative Law – The order of application of two separate terms is not important

o A.B=B.A The order in which two variables are AND’ed makes no

difference
o A+B=B+A The order in which two variables are OR’ed makes no
difference

 Double Negation Law – A term that is inverted twice is equal to the original term

o A =A A double complement of a variable is always equal to the

variable

 de Morgan´s Theorem – There are two “de Morgan´s” rules or theorems,

 (1) Two separate terms NORéd together is the same as the two terms inverted
(Complement) and ANDéd for example: A+B = A . B

 (2) Two separate terms NANDéd together is the same as the two terms inverted
(Complement) and ORéd for example: A.B = A + B
Other algebraic Laws of Boolean not detailed above include:
 Distributive Law – This law permits the multiplying or factoring out of an expression.

o A(B + C) = A.B + A.C (OR Distributive Law)

Page 6 of 11
o A + (B.C) = (A + B).(A + C) (AND Distributive Law)


 Absorptive Law – This law enables a reduction in a complicated expression to a
simpler one by absorbing like terms.

o A + (A.B) = A (OR Absorption Law)

o A(A + B) = A (AND Absorption Law)

 Associative Law – This law allows the removal of brackets from an expression and
regrouping of the variables.

o A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)

o A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Boolean Algebra Functions

Using the information above, simple 2-input AND, OR and NOT Gates can be
represented by 16 possible functions as shown in the following table.
Function Description Expression
1. NULL 0
2. IDENTITY 1
3. Input A A
Page 7 of 11
4. Input B B
5. NOT A A
6. NOT B B
7. A AND B (AND) A.B
8. A AND NOT B A.B
9. NOT A AND B A.B
10. NOT AND (NAND) A.B
11. A OR B (OR) A+B
12. A OR NOT B A+B
13. NOT A OR B A+B
14. NOT OR (NOR) A+B
Page 8 of 11
15. Exclusive-OR A.B+A.B
16. Exclusive-NOR A.B+A.B
Laws of Boolean Algebra Example No1

Using the above laws, simplify the following expression: (A + B)(A + C)
Q= (A + B).(A + C)
A.A + A.C + A.B + B.C – Distributive law
A + A.C + A.B + B.C – Idempotent AND law (A.A = A)
A(1 + C) + A.B + B.C – Distributive law
A.1 + A.B + B.C – Identity OR law (1 + C = 1)
A(1 + B) + B.C – Distributive law
A.1 + B.C – Identity OR law (1 + B = 1)
Q= A + (B.C) – Identity AND law (A.1 = A)
Page 9 of 11
Then the expression: (A + B)(A + C) can be simplified to A + (B.C) as in the Distributive

law.
The conclusion
 Boolean algebra is a branch of mathematics that deals with operations on logical
values with binary variables.
 The Boolean variables are represented as binary numbers to represent truths: 1 =
true and 0 = false.
 Elementary algebra deals with numerical operations whereas Boolean algebra deals
with logistical operations.
 Boolean algebra utilizes conjunction, disjunction, and negation, as opposed to
addition, subtraction, multiplication, and division.
 The primary modern use of Boolean algebra is in computer programming languages.
 Boolean algebra is based on a set of fixed rules and laws that differ from the basic
rules and laws of elementary algebra
Page 10 of 11
Scientific sources:
1.Introduction to Logic Design (Third Edition) By Alan B.Marcovitz
2. Obliged: Logic Design By D.WALAA
WEP sources:
1. https://www.investopedia.com/
2. https://www.electronics-tutorials.ws/
Page 11 of 11

Boolean Algebra Report PDF

Uploaded by

Copyright:

Available Formats

You might also like

Boolean Algebra Report PDF

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Boolean Algebra Report PDF

Uploaded by

Copyright:

Available Formats

REPORT TITLE:

Department: Computer Engineering Department

What Is Boolean Algebra?

Understanding Boolean Algebra

Laws of Boolean Algebra

Truth Tables for the Laws of Boolean

Boolean Equivalent Boolean Algebra

A+B = A.B invert and replace OR with AND de Morgan’s Theorem

A.B = A+B invert and replace AND with OR de Morgan’s Theorem

Description of the Laws of Boolean Algebra

o A.0=0 A variable AND’ed with 0 is always equal to 0

o A + 0 = A A variable OR’ed with 0 is always equal to the variable

o A+A=A A variable OR’ed with itself is always equal to the variable

o A.A=A A variable AND’ed with itself is always equal to the variable

o A.A=0 A variable AND’ed with its complement is always equal to 0

o A.B=B.A The order in which two variables are AND’ed makes no

o A =A A double complement of a variable is always equal to the

Other algebraic Laws of Boolean not detailed above include:

o A(B + C) = A.B + A.C (OR Distributive Law)

o A + (B.C) = (A + B).(A + C) (AND Distributive Law)

o A + (A.B) = A (OR Absorption Law)

o A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)

Boolean Algebra Functions

Function Description Expression

7. A AND B (AND) A.B

8. A AND NOT B A.B

9. NOT A AND B A.B

10. NOT AND (NAND) A.B

11. A OR B (OR) A+B

12. A OR NOT B A+B

13. NOT A OR B A+B

14. NOT OR (NOR) A+B

15. Exclusive-OR A.B+A.B

16. Exclusive-NOR A.B+A.B

Laws of Boolean Algebra Example No1

A.A + A.C + A.B + B.C – Distributive law

A + A.C + A.B + B.C – Idempotent AND law (A.A = A)

A(1 + C) + A.B + B.C – Distributive law

A.1 + A.B + B.C – Identity OR law (1 + C = 1)

A(1 + B) + B.C – Distributive law

A.1 + B.C – Identity OR law (1 + B = 1)

Q= A + (B.C) – Identity AND law (A.1 = A)

Then the expression: (A + B)(A + C) can be simplified to A + (B.C) as in the Distributive

You might also like