Boolean Algebra Truth Tables

Boolean Algebra Expressions can be used to construct digital logic truth tables for
their respective functions

Advertisement

As well as a standard Boolean Expression, the input and output information of any
Logic Gate or circuit can be plotted into standard Boolean Algebra truth tables to give
a visual representation of the switching function of the system.

The table used to represent the boolean expression of a logic gate function is
commonly called a Truth Table. A logic gate truth table shows each possible input
combination to the gate or circuit with the resultant output depending upon the
combination of these input(s).

For example, consider a single 2-input logic circuit with input variables labelled as A
and B. There are “four” possible input combinations or 22 of “OFF” and “ON” for the
two inputs. However, when dealing with Boolean expressions and especially logic
gate truth tables, we do not general use “ON” or “OFF” but instead give them bit
values which represent a logic level “1” or a logic level “0” respectively.

Then the four possible combinations of A and B for a 2-input logic gate is given as:

Input Combination 1. – “OFF” – “OFF” or ( 0, 0 )

Input Combination 2. – “OFF” – “ON” or ( 0, 1 )
Input Combination 3. – “ON” – “OFF” or ( 1, 0 )
Input Combination 4. – “ON” – “ON” or ( 1, 1 )
Therefore, a 3-input logic circuit would have 8 possible input combinations or 23 and
a 4-input logic circuit would have 16 or 24, and so on as the number of inputs
increases. Then a logic circuit with “n” number of inputs would have 2n possible
input combinations of both “OFF” and “ON”.

So in order to keep things simple to understand, in this tutorial we will only deal with
standard 2-input type logic gates, but the principals are still the same for gates with
more than two inputs.

Then the Truth tables for a 2-input AND Gate, a 2-input OR Gate and a single input
NOT Gate are given as:

Boolean Algebra Truth Tables For A 2-input AND Gate

For a 2-input AND gate, the output Q is true if BOTH input A “AND” input B are
both true, giving the Boolean Expression of: ( Q = A and B ).

Symbol Truth Table

boolean algebra AND gate truth table A B Q
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Expression Q = A.B Read as A AND B gives Q
Note that the Boolean Expression for a two input AND gate can be written as: A.B or
just simply AB without the decimal point.

Boolean Algebra Truth Tables For A 2-input OR Gate

For a 2-input OR (Inclusive-OR) gate, the output Q is true if EITHER input A “OR”
input B is true, giving the Boolean Expression of: ( Q = A or B ).

Symbol Truth Table

boolean algebra OR gate truth table A B Q
0 0 0
0 1 1
1 0 1
1 1 1
Boolean Expression Q = A+B Read as A OR B gives Q
Boolean Algebra Truth Tables For The NOT Gate
For a single input NOT (Inverter) gate, the output Q is ONLY true when the input is
“NOT” true, the output is the inverse or complement of the input giving the Boolean
Expression of: ( Q = NOT A ).

Symbol Truth Table

boolean algebra NOT gate truth table A Q
0 1
1 0
Boolean Expression Q = NOT A or A Read as inversion of A gives Q
The NAND and the NOR Gates are a combination of the AND and OR Gates
respectively with that of a NOT Gate (inverter).

2-input NAND (Not AND) Gate

For a 2-input NAND gate, the output Q is NOT true if BOTH input A and input B are
true, giving the Boolean Expression of: ( Q = not(A AND B) ).

Symbol Truth Table

NAND gate truth table A B Q
0 0 1
0 1 1
1 0 1
1 1 0
Boolean Expression Q = A .BRead as A AND B gives NOT-Q
2-input NOR (Not OR) Gate
For a 2-input NOR gate, the output Q is true if BOTH input A and input B are NOT
true, giving the Boolean Expression of: ( Q = not(A OR B) ).

Symbol Truth Table

NOR gate truth table A B Q
0 0 1
0 1 0
1 0 0
1 1 0
Boolean Expression Q = A+B Read as A OR B gives NOT-Q
As well as the standard logic gates there are also two special types of logic gate
function called an Exclusive-OR Gate and an Exclusive-NOR Gate. The Boolean
expression to indicate an Exclusive-OR or Exclusive-NOR function is to a symbol
with a plus sign inside a circle, ( ⊕ ).

The switching actions of both of these types of gates can be created using the above
standard logic gates. However, as they are widely used functions they are now
available in standard IC form and have been included here as reference.

2-input EX-OR (Exclusive OR) Gate

For a 2-input Ex-OR gate, the output Q is true if EITHER input A or if input B is true,
but NOT both giving the Boolean Expression of: ( Q = (A and NOT B) or (NOT A
and B) ).

Symbol Truth Table

Ex-OR gate truth table A B Q
0 0 0
0 1 1
1 0 1
1 1 0
Boolean Expression Q = A ⊕ B
2-input EX-NOR (Exclusive NOR) Gate
For a 2-input Ex-NOR gate, the output Q is true if BOTH input A and input B are the
same, either true or false, giving the Boolean Expression of: ( Q = (A and B) or (NOT
A and NOT B) ).

Symbol Truth Table

Ex-NOR gate truth table A B Q
0 0 1
0 1 0
1 0 0
1 1 1
Boolean Expression Q = A ⊕ B
Summary of 2-input Logic Gates
The following Boolean ALgebra Truth Tables compare the logical functions of the 2-
input logic gates above.

Inputs Truth Table Outputs For Each Gate

A B AND NAND OR NOR EX-OR EX-NOR
0 0 0 1 0 1 0 1
0 1 0 1 1 0 1 0
1 0 0 1 1 0 1 0
1 1 1 0 1 0 0 1
The following Boolean Algebra truth tables gives a list of the common logic functions
and their equivalent Boolean notation.
Logic Function Boolean Notation
AND A.B
OR A+B
NOT A
NAND A .B
NOR A+B
EX-OR (A.B) + (A.B) or A ⊕ B
EX-NOR (A.B) + (A.B) or A ⊕ B
2-input logic gate truth tables are given here as examples of the operation of each
logic function, but there are many more logic gates with 3, 4 even 8 individual inputs.
The multiple input gates are no different to the simple 2-input gates above, So a 4-
input AND gate would still require ALL 4-inputs to be present to produce the required
output at Q and its larger truth table would reflect that.

previousPrevious
Laws of Boolean Algebra
Next
Boolean Algebra Examplesnext
542 Comments
Join the conversation
Your Name
Email Address
Write your comment here
Notify me of follow-up comments by email.

Ella
I don’t understand this pls explain further

Posted on September 07th 2023 | 9:58 pm

Reply
Berry John
Am interested

Posted on August 28th 2023 | 5:56 am

Reply
John Thomas
I am a student

Posted on August 28th 2023 | 5:24 am

Reply
Yagade Emmanuel
very nice

Posted on August 08th 2023 | 12:14 am

Reply
Stranger X
Nice work gyz plz continue with it

Posted on July 24th 2023 | 5:54 pm

Reply
Abdul
Help in solving Sum of product and Sum of product

Posted on July 20th 2023 | 2:55 pm

Reply
Okonkwo ozioma
I want to learn

Posted on July 10th 2023 | 12:59 am

Reply
Charles maina
It explain very smart

Posted on June 25th 2023 | 5:44 pm

Reply
Eng fidel
Easy to understand kindly can you also try out binary

Posted on June 12th 2023 | 3:02 pm

Reply
Asha
Can someone explain how to solve sum of products

Posted on June 02nd 2023 | 5:31 am

Reply
Wayne Storr
Please read our tutorial about Sum of Products

Posted on June 02nd 2023 | 9:08 am

Reply
Prince
Nice work

Posted on April 28th 2023 | 7:17 pm

Reply
Cate
Construct the truth table and the logic gates of the following Boolean functions. 1.
f(x,y) = [xy + (x + y)’]’ and 2. f(x,y) = (x + y) ⊕ (xy)’

Posted on March 24th 2023 | 1:40 pm

Reply
Abdullah Faisal
(A+B) (A+C) = A + B.C
Please explain the truth table of it

Posted on March 13th 2023 | 6:02 pm

Reply
Mark Nesselhaus
A good example of reducing logic gates from 2 OR gates and a AND gate on the left
to a single OR and AND on the right. Here is what I think the Truth Table is,
assuming the result as Q. If A=1 then Q=1 no matter what the value B and C is. Also
if B and C are 1 then Q=1 no matter the value of A. I used Logisim to test the logic.
I hope this helps.

ABCQ
0000
0100
0010
0111
1001
1101
1011
1111

Posted on March 13th 2023 | 9:07 pm

Reply
Henrietta
I love it please I want to follow this page

Posted on March 02nd 2023 | 2:41 am

Reply
RUBEN
In this logic gates a nd Boolean expression is understanding is very clear. 👍

Posted on March 02nd 2023 | 2:38 am

Reply
Twinamatsiko Nicholus
Good

Posted on February 27th 2023 | 6:49 pm

Reply
Few
Thankyou

Posted on February 27th 2023 | 5:21 am

Reply
Hiren
A+B[AC+(B+C)D]

Posted on February 16th 2023 | 7:17 am

Reply
More
PATRICK JOSHUA
I’m very happy with the topic of logic gate

Posted on February 06th 2023 | 8:41 pm

Reply
Farooqui Hammad
Plz Explain All Examples K–map For All Variables
Posted on January 29th 2023 | 4:36 pm
Reply
View More
Read more Tutorials inBoolean Algebra
1. Logic AND Function
2. Logic OR Function
3. Logic NOT Function
4. Logic NAND Function
5. Logic NOR Function
6. Laws of Boolean Algebra
7. Boolean Algebra Truth Tables
8. Boolean Algebra Examples
9. DeMorgan’s Theorem
10. Switching Theory
11. Sum of Product
12. Product of Sum
13. Boolean Algebra Simplification
Advertisement

Advertisement

THE BASICS
Contact Us
Privacy Policy
Terms of Use
FOR ADVERTISERS
Contact Sales
Media Guide Request
ASPENCORE NETWORK
EDN EE Times EEWeb Electronic Products Power Electronics News EPSNews
Embedded Planet Analog ElectroSchematics TechOnline Datasheets.com Electronics
Know How IoT Times The Channelist
GLOBAL NETWORK
EE Times Asia EE Times China EE Times India EE Times Japan EE Times Taiwan
EDN Asia EDN China EDN Taiwan EDN Japan ESM China
CONNECT WITH US
Facebook
AspenCore logo general
All contents are Copyright © 2023 by AspenCore, Inc. All rights reserved.Electronics
Tutorials Logo
Register to download premium content!
Electronics Tutorials White LogoX

DeutschDeutsch PolskiPolski
Register
Log In
AC Circuits
Amplifiers
Attenuators
Binary Numbers
Boolean Algebra
Capacitors
Combinational Logic
Connectivity
Counters
DC Circuits
Diodes
Electromagnetism
Filters
Inductors
Input/Output Devices
Logic Gates
Miscellaneous Circuits
Operational Amplifiers
Oscillator
Power Electronics
Power Supplies
Premium
RC Networks
Resistors
Resources
Sequential Logic
Systems
Transformers
Transistors
Waveform Generators
Premium Content
Further Education
Sitemap
Contact Us
Home / Boolean Algebra / Boolean Algebra Truth Tables
Boolean Algebra Truth Tables
Boolean Algebra Truth Tables
Boolean Algebra Expressions can be used to construct digital logic truth tables for
their respective functions

Advertisement

As well as a standard Boolean Expression, the input and output information of any
Logic Gate or circuit can be plotted into standard Boolean Algebra truth tables to give
a visual representation of the switching function of the system.

The table used to represent the boolean expression of a logic gate function is
commonly called a Truth Table. A logic gate truth table shows each possible input
combination to the gate or circuit with the resultant output depending upon the
combination of these input(s).

For example, consider a single 2-input logic circuit with input variables labelled as A
and B. There are “four” possible input combinations or 22 of “OFF” and “ON” for the
two inputs. However, when dealing with Boolean expressions and especially logic
gate truth tables, we do not general use “ON” or “OFF” but instead give them bit
values which represent a logic level “1” or a logic level “0” respectively.

Then the four possible combinations of A and B for a 2-input logic gate is given as:

Input Combination 1. – “OFF” – “OFF” or ( 0, 0 )

Input Combination 2. – “OFF” – “ON” or ( 0, 1 )
Input Combination 3. – “ON” – “OFF” or ( 1, 0 )
Input Combination 4. – “ON” – “ON” or ( 1, 1 )
Therefore, a 3-input logic circuit would have 8 possible input combinations or 23 and
a 4-input logic circuit would have 16 or 24, and so on as the number of inputs
increases. Then a logic circuit with “n” number of inputs would have 2n possible
input combinations of both “OFF” and “ON”.

So in order to keep things simple to understand, in this tutorial we will only deal with
standard 2-input type logic gates, but the principals are still the same for gates with
more than two inputs.

Then the Truth tables for a 2-input AND Gate, a 2-input OR Gate and a single input
NOT Gate are given as:

Boolean Algebra Truth Tables For A 2-input AND Gate

For a 2-input AND gate, the output Q is true if BOTH input A “AND” input B are
both true, giving the Boolean Expression of: ( Q = A and B ).

Symbol Truth Table

boolean algebra AND gate truth table A B Q
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Expression Q = A.B Read as A AND B gives Q
Note that the Boolean Expression for a two input AND gate can be written as: A.B or
just simply AB without the decimal point.

Boolean Algebra Truth Tables For A 2-input OR Gate

For a 2-input OR (Inclusive-OR) gate, the output Q is true if EITHER input A “OR”
input B is true, giving the Boolean Expression of: ( Q = A or B ).

Symbol Truth Table

boolean algebra OR gate truth table A B Q
0 0 0
0 1 1
1 0 1
1 1 1
Boolean Expression Q = A+B Read as A OR B gives Q
Boolean Algebra Truth Tables For The NOT Gate
For a single input NOT (Inverter) gate, the output Q is ONLY true when the input is
“NOT” true, the output is the inverse or complement of the input giving the Boolean
Expression of: ( Q = NOT A ).

Symbol Truth Table

boolean algebra NOT gate truth table A Q
0 1
1 0
Boolean Expression Q = NOT A or A Read as inversion of A gives Q
The NAND and the NOR Gates are a combination of the AND and OR Gates
respectively with that of a NOT Gate (inverter).

2-input NAND (Not AND) Gate

For a 2-input NAND gate, the output Q is NOT true if BOTH input A and input B are
true, giving the Boolean Expression of: ( Q = not(A AND B) ).

Symbol Truth Table

NAND gate truth table A B Q
0 0 1
0 1 1
1 0 1
1 1 0
Boolean Expression Q = A .BRead as A AND B gives NOT-Q
2-input NOR (Not OR) Gate
For a 2-input NOR gate, the output Q is true if BOTH input A and input B are NOT
true, giving the Boolean Expression of: ( Q = not(A OR B) ).

Symbol Truth Table

NOR gate truth table A B Q
0 0 1
0 1 0
1 0 0
1 1 0
Boolean Expression Q = A+B Read as A OR B gives NOT-Q
As well as the standard logic gates there are also two special types of logic gate
function called an Exclusive-OR Gate and an Exclusive-NOR Gate. The Boolean
expression to indicate an Exclusive-OR or Exclusive-NOR function is to a symbol
with a plus sign inside a circle, ( ⊕ ).

The switching actions of both of these types of gates can be created using the above
standard logic gates. However, as they are widely used functions they are now
available in standard IC form and have been included here as reference.

2-input EX-OR (Exclusive OR) Gate

For a 2-input Ex-OR gate, the output Q is true if EITHER input A or if input B is true,
but NOT both giving the Boolean Expression of: ( Q = (A and NOT B) or (NOT A
and B) ).

Symbol Truth Table

Ex-OR gate truth table A B Q
0 0 0
0 1 1
1 0 1
1 1 0
Boolean Expression Q = A ⊕ B
2-input EX-NOR (Exclusive NOR) Gate
For a 2-input Ex-NOR gate, the output Q is true if BOTH input A and input B are the
same, either true or false, giving the Boolean Expression of: ( Q = (A and B) or (NOT
A and NOT B) ).

Symbol Truth Table

Ex-NOR gate truth table A B Q
0 0 1
0 1 0
1 0 0
1 1 1
Boolean Expression Q = A ⊕ B
Summary of 2-input Logic Gates
The following Boolean ALgebra Truth Tables compare the logical functions of the 2-
input logic gates above.

Inputs Truth Table Outputs For Each Gate

A B AND NAND OR NOR EX-OR EX-NOR
0 0 0 1 0 1 0 1
0 1 0 1 1 0 1 0
1 0 0 1 1 0 1 0
1 1 1 0 1 0 0 1
The following Boolean Algebra truth tables gives a list of the common logic functions
and their equivalent Boolean notation.

Logic Function Boolean Notation

AND A.B
OR A+B
NOT A
NAND A .B
NOR A+B
EX-OR (A.B) + (A.B) or A ⊕ B
EX-NOR (A.B) + (A.B) or A ⊕ B
2-input logic gate truth tables are given here as examples of the operation of each
logic function, but there are many more logic gates with 3, 4 even 8 individual inputs.
The multiple input gates are no different to the simple 2-input gates above, So a 4-
input AND gate would still require ALL 4-inputs to be present to produce the required
output at Q and its larger truth table would reflect that.

previousPrevious
Posted on August 28th 2023 | 5:56 am

Construct the truth table and the logic gates of the following Boolean functions. 1.
f(x,y) = [xy + (x + y)’]’ and 2. f(x,y) = (x + y) ⊕ (xy)’