Interpreting
Logical equivalence
Vocab:
Logical Equivalence- compound
proposition p and q are said to be logically
equivalent if p <-> q is a tautology.
TAUTOLOGY- a proposition that is always
true, regardless of the truth values of the
propositional variables it contain
Vocab:
CONTRADICTION- a proposition that is
always false.
CONTINGENCY- a propotion neither a
tautology nor a contradiction
example:
Contradicti
on
p ~p p ^ ~p
T F F
F T F
example:
Contingen
Show
cy that (p -> q) <-> ( q -> p) is a
~ ~
tautology
p q p -> q ~q -> ~p (p -> q) <-> (~q -> ~p)
p q
T T F F T T T
T F F T F F T
F T T F T T T
F F T T T T T
Logical equivalence
What is logical equivalence
Logical Equivalence- is an important
concept in mathematics that examines
the relationship between logical
statement and their components.
- Process determining if two statement are
logically equivalent to each other.
#1 example: ~P v Q is logically
equivalent to P→Q because ~ P v Q is
logically equivalent to P→Q because the
symbol ~P v Q is the same as P→Q in
its logical form.
P Q P→Q ~P^Q
T T T T
T F F F
F F T T
F F T F
This statement is a logical equivalent because it
expresses the same logical relationship regardless
of the symbol used.
In mathematics, logical equivalence is a
relationship between two statements or
propositions that are either both true or false in the
same circumstances. It's represented by a double
arrow (⟺ or ⟷) or triple lines (≡). For example, "P
Q" means "P is logically equivalent to Q".
•They imply each other
•If one statement is true, then the other must also be
true.
•If one statement is false, then the other must also be
false.
Logical equivalence is important because it allows you
to change one proposition for another while
maintaining its truth value. It's also useful for
programmers to write efficient code and optimize
algorithms.
Truth table
(Negation, conjunction ,AND
DISJUNCTION)
egation- opposite truth value from the statement.
Negation
p ~p
T F
F T
Disjunction – Only false when both statements are
false.
Disjunction
p q pvq
T T T
T F T
F T T
F F F
unction – Only true when both statements are true.
Conjunction
p q pvq
T T T
T F F
F T F
F F F
MAKING OF TRUTH TABLE
Example Applying the definition of Negation, Conjunction and
disjunction.
Let p and q represent the following statement:
p: 6>3 6 is greater than 3
q: 2<4 2 is less than 4
Using conjunction table:
• p^q TRUE
Conjunction
Conjunction
p q pvq
•~p^q FALSE T
T
T
F
T
F
p q F
F
T
F
F
F pvq
T T T
T F F
F T F
F F F
et p and q represent the following statement:
6>3 6 is greater than 3
2<4 2 is less than 4
sing disjunction table:
v~q TRUE
~pv ~q FALSE
Disjunction
Conjunction
p q pvq
p q T
T
T
F
T
F pvq
F T F
T T F F F
T
T F T
F T T
F F F
Construct a truth table for ~( p ^ q )
Example
Let p and q represent the following statement:
p: Dog is an animal
q: Cat is an animal
p^q Dog is an animal, and Cat is an
animal TRUE
~(p ^ q ) Dog is an not animal, and Cat is not
an animal FALSE ^Conjunction
p q pvq ~(pvq)
T T T F
T F F T
F T F T
F F F T
onstruct a truth table for (~pvq)^~q
p q ~p ~p v ~q (~p v q)^
q ~q
T T F T F F
T F F F T F
F T T T F F
F F T T T T
Process:
Break apart the problem to
determine which operation
symbol is needed and pull
out data for the expression.
Examples:
The sum of 65 a less than 55
and p
65 + p 55 - a
Practice:
1. Twice the sum of 5 and
b
2. 12 decreased by n
3. 40 shared equally
among v
Answers:
1. 2 ( 5 + b )
2. 12 - n
3. 40 ÷ v
Word Problem
Write and expression to solve.
Rachel and her 3 friends each bough
lemonade for 2 dollars. How many money
was spent?
