TRUTH TABLE:

UNDERSTANDING
LOGICAL OPERATORS
AND PROPOSITIONS
Truth Table

• A truth table is a mathematical table used in

logic to determine the outcomes of logical
expressions. It analyzes logical propositions and
their outcomes based on different logical
operators like conjunction, disjunction, negation,
biconditional and conditional statements. In this
lesson, you'll learn about each of these operators
and the difference between tautology,
contradiction, and contingency outcomes.
Five Common Logical Connectives
or Operators
1.Logical Conjunction (AND)
2.Logical Disjunction (Inclusive OR)
3.Logical Negation (NOT)
4.Logical Implication (Conditional)
5.Logical Biconditional (Double Implication)
Conjunction (AND) ˄
• Conjunction is a logical operator represented by the
symbol ˄ , and it connects two propositions to produce a
truth value based on the truth values of the two
propositions. It returns true only when both propositions
are true; if either is false, the result will be false.
• In a truth table, the conjunction of propositions p and q
is represented as p ˄ q.
• To illustrate, if p represents the statement "It's raining
outside", and q stands for "I am wearing a coat", then
"It's raining outside ˄ I am wearing a coat" implies that I
am prepared for the weather only if both statements are
true.
Conjunction (AND) ˄
• A conjunction is a type of
compound statement that is
comprised of two
propositions (also known as
simple statements) joined by
the AND operator.
• P∧Q is read as “P and Q.”
• Remember: The truth value
of the compound
statement P∧Q is only true if
the truth values P and Q are
both true. Otherwise, P∧Q is
false.
Disjunction (OR) ˅
• Disjunction is a logical operator represented by
the symbol ˅ , and it connects two propositions
to produce a truth value based on the truth
values of the two propositions. It yields true if
either or both statements are true.
• The disjunction of a set of propositions results in
a proposition being true if any of the
components of the proposition is true. For
instance, in the proposition "I'll have either a
coffee or tea," the statement is true if I have
either a coffee or tea, or both, false only if I have
neither.
 Disjunction (OR)
• A disjunction is a kind of compound
statement that is composed of two
simple statements formed by joining
the statements with the OR operator.
• In a disjunction statement, the use of
OR is inclusive. That means “one or the
other” or both.
• P∨Q is read as “P or Q.”
• Remember: The truth value of the
compound statement P∨Q is true if the
truth value of either the two simple
statements P and Q is true.
Moreso, P∨Q is also true when the truth
values of both statements P and Q are
true. However, the only time the
disjunction statement P∨Q is false,
happens when the truth values of
both P and Q are false.
NEGATION (NOT) ¬
• Negation (¬) is a unary operation that takes only
one proposition as its input. It changes the truth
value of a proposition either from true to false or
from false to true.
• Example:
• "I am not tired" means that I am not feeling
sleepy or exhausted.
• "The train is not on time" implies that the train is
late.
NEGATION (NOT)
• The negation of a statement is
also a statement with a truth value
that is exactly opposite that of the
original statement.
• ¬P is read as “not P.”
• Remember: The negation
operator denoted by the
symbol ~ or ¬ takes the truth
value of the original statement
then output the exact opposite of
its truth value. In other words,
negation simply reverses the truth
value of a given statement. Thus, if
statement P is true then the truth
value of its negation is false. In the
same manner if P is false the truth
value of its negation is true.
Conditional (IMPLIES)

• A conditional statement is a logical operator that

indicates that "if one statement is true, then
another statement is also true." It connects two
statements, the hypothesis, and the conclusion.
• Let's consider the conditional statement: If it's
raining outside, then the ground is wet. In this
statement, "it's raining outside" is the
hypothesis, while "the ground is wet" is the
conclusion. If it's raining outside, then the
ground is going to be wet.
Conditional (IMPLIES)
• An implication (conditional
statement) is a type of
compound statement that is
formed by joining two simple
statements with the logical
implication connective or
operator.
• P→Q is read as “P implies Q”.
• Remember: The truth value of
the compound
statement P→Q is true when
both the simple
statements P and Q are true.
Moreso, P→Q is always true
if P is false. The only scenario
that P→Q is false happens
when P is true, and Q is false.
Biconditional (EQUIVALENT) ↔
• The biconditional statement is a logical operator
that states "if and only if." It is represented by the
symbol " ↔ “. It connects two propositions and
returns true if and only if the truth values of the two
propositions are the same.
• Example:
• "You can start the car if and only if you have the
key" means that the car can be started if and only if
the key is available. Similarly, "it is raining if and
only if the clouds are present" means that the rain
occurs only if the clouds are present, and vice
versa.
 Biconditional
• A double implication (biconditional
statement) is a type of compound
statement that is formed by joining
two simple statements with the
biconditional operator. A biconditional
statement is really a combination of a
conditional statement and its
converse.
• P↔Q is read as “P if and only if Q.”
• Where P is known as the antecedent
• Where Q is known as the consequent
• Remember: The truth value of the
biconditional statement P↔Q is true
when both simple
statements P and Q are both true or
both false. Otherwise, P↔Q is false.
Try this, (¬P^Q)→Q

P Q ¬P ¬P^Q (¬P^Q)→
Q
Try this, (P^ ¬Q) ↔ (P→Q)

P Q ¬Q P^ ¬Q (P^ ¬Q) ↔ P→Q

(P→Q)
Try this, (P V ¬Q) → (P ^ Q)
P Q PV
¬Q
¬Q (P V ¬Q) → (P ^ P ^Q
Q)
Difference between
Tautology,
Contradiction, and
Contingency
Tautology

• A tautology is a statement or proposition that is

always true (has a truth value of 1).
Contradiction

• Contradiction is a statement or proposition that

is always false (has a truth value of 0).
Contingency
• A contingency statement is a statement or
proposition that is neither a tautology nor a
contradiction.
In simpler terms, a tautology always
yields true, regardless of the truth
value of the propositions it is
composed of. A contradiction always
returns false and is always false, and
a contingency is a statement that can
be true or false based on the truth
values of its components.
Conclusion

• Logic propositions play a vital role in computer

science, where they are used to represent the
steps of an algorithm, and in artificial
intelligence, where they are used to establish
knowledge bases