Scribd
Upload
20 views

Boolean

Boolean algebra is a branch of mathematics that deals with binary variables and logical operations. It was developed by George Boole in the 19th century. In Boolean algebra, variables can only take the values true or false. The algebra revolves around three fundamental logical operations: AND, OR, and NOT. It has properties such as closure, identity, commutativity, associativity, distributivity, and complement.

Uploaded by

nacayajamaica13
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views

Boolean

Boolean algebra is a branch of mathematics that deals with binary variables and logical operations. It was developed by George Boole in the 19th century. In Boolean algebra, variables can only take the values true or false. The algebra revolves around three fundamental logical operations: AND, OR, and NOT. It has properties such as closure, identity, commutativity, associativity, distributivity, and complement.

Uploaded by

nacayajamaica13
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Boolean algebra is a branch of

mathematics and a system of


symbolic logic that deals with the
manipulation and analysis of binary
variables and logical operations. It
was developed by George Boole in
the mid-19th century.

In Boolean algebra, variables can


only have one of two possible
values, typically represented as true
(1) or false (0). It revolves around
three fundamental logical
operations
Identity Laws:

Definition: These laws state that combining any Boolean


variable with 0 (false) using the OR operation results in
the original variable. Similarly, combining any Boolean
variable with 1 (true) using the AND operation yields the
original variable.
Laws:
�
+
0
=
�
A+0=A
�
⋅
1
=
�
A⋅1=A

Domination Laws:

Definition: These laws state that combining any Boolean


variable with 1 (true) using the OR operation results in 1
(true). Similarly, combining any Boolean variable with 0
(false) using the AND operation yields 0 (false).
Laws:
�
+
1
=
1
A+1=1
�
⋅
0
=
0
A⋅0=0

Commutative Laws:

Definition: These laws state that the order of operands


does not affect the result of the Boolean operation.
Whether you OR or AND two variables, the result remains
the same.
Laws:
�
+
�
=
�
+
�
A+B=B+A
�
⋅
�
=
�
⋅
�
A⋅B=B⋅A

Associative Laws:

Definition: These laws state that the grouping of variables


does not affect the result of the Boolean operation.
Whether you group them differently, the result remains
unchanged.
Laws:
�
+
(
�
+
�
)
=
(
�
+
�
)
+
�
A+(B+C)=(A+B)+C
�
⋅
(
�
⋅
�
)
=
(
�
⋅
�
)
⋅
�
A⋅(B⋅C)=(A⋅B)⋅C

Distributive Laws:

Definition: These laws describe how the AND and OR


operations distribute over each other. They are useful for
simplifying Boolean expressions.
Laws:
�
⋅
(
�
+
�
)
=
(
�
⋅
�
)
+
(
�
⋅
�
)
A⋅(B+C)=(A⋅B)+(A⋅C)
�
+
(
�
⋅
�
)
=
(
�
+
�
)
⋅
(
�
+
�
)
A+(B⋅C)=(A+B)⋅(A+C)

Complement Laws:

Definition: These laws describe the relationship between a


Boolean variable and its complement (negation).
Combining a variable with its complement using OR
results in 1 (true), while combining them using AND results
in 0 (false).
Laws:
�
+
�
ˉ
=
1
A+
A
ˉ
=1
�
⋅
�
ˉ
=
0
A⋅
A
ˉ
=0

Idempotent Laws:
Definition: These laws state that combining a variable with
itself using either OR or AND results in the original
variable.
Laws:
�
+
�
=
�
A+A=A
�
⋅
�
=
�
A⋅A=A

Double Negation Law:

Definition: This law states that applying the NOT operation


twice to a variable results in the original variable.
Law:
�
ˉ
‾
=
�
A
ˉ
=A

Absorption Laws:

Definition: These laws describe how one term can be


absorbed into another term in a Boolean expression,
simplifying it.
Laws:
�
+
(
�
⋅
�
)
=
�
A+(A⋅B)=A
�
⋅
(
�
+
�
)
=
�
A⋅(A+B)=A

De Morgan's Laws:

Definition: These laws describe how to express the


complement of a compound expression in terms of the
complements of its individual parts and the opposite
logical operation.
Laws:
�
+
�
‾
=
�
ˉ
⋅
�
ˉ
A+B

=
A
ˉ
⋅
B
ˉ
�
⋅
�
‾
=
�
ˉ
+
�
ˉ
A⋅B
=
A
ˉ
+
B
ˉ

Closure: For any two elements


�
A and
�
B in the algebra, the result of applying the operations
+
+ (logical OR) and
⋅
⋅ (logical AND) to them is also an element of the algebra.

Complement: For every element


�
A in the algebra, there exists a complement
�
ˉ
A
ˉ
such that
�
+
�
ˉ
=
1
A+
A
ˉ
=1 and
�
⋅
�
ˉ
=
0
A⋅
A
ˉ
=0.
Associativity: Operations
+
+ and
⋅
⋅ are associative, meaning that
�
+
(
�
+
�
)
=
(
�
+
�
)
+
�
A+(B+C)=(A+B)+C and
�
⋅
(
�
⋅
�
)
=
(
�
⋅
�
)
⋅
�
A⋅(B⋅C)=(A⋅B)⋅C for any elements
�
A,
�
B, and
�
C in the algebra.

Distributivity: The operations


+
+ and
⋅
⋅ distribute over each other, meaning that
�
⋅
(
�
+
�
)
=
(
�
⋅
�
)
+
(
�
⋅
�
)
A⋅(B+C)=(A⋅B)+(A⋅C) and
�
+
(
�
⋅
�
)
=
(
�
+
�
)
⋅
(
�
+
�
)
A+(B⋅C)=(A+B)⋅(A+C) for any elements
�
A,
�
B, and
�
C in the algebra.

Identity: There exist two elements,


0
0 and
1
1, such that for any element
�
A in the algebra,
�
+
0
=
�
A+0=A and
�
⋅
1
=
�
A⋅1=A.

Commutativity: Operations
+
+ and
⋅
⋅ are commutative, meaning that
�
+
�
=
�
+
�
A+B=B+A and
�
⋅
�
=
�
⋅
�
A⋅B=B⋅A for any elements
�
A and
�
B in the algebra.

Idempotent Laws: These laws state that combining a


variable with itself using either OR or AND results in the
original variable.

�
+
�
=
�
A+A=A
�
⋅
�
=
�
A⋅A=A
Double Negation Law: This law states that applying the
NOT operation twice to a variable results in the original
variable.

�
ˉ
‾
=
�
A
ˉ
=A

You might also like