Lecture 2

Propositional Equivalences
An important type of step used in a mathematical argument is the replacement of a statement with
another statement with the same truth value. Because of this, methods that produce propositions with
the same truth value as a given compound proposition are used extensively in the construction of
mathematical arguments.
We begin our discussion with a classification of compound propositions according to their possible
truth values.
A compound proposition that is always true, no matter what the truth values of the propositions that
occur in it, is called a tautology. A compound proposition that is always false is called a
contradiction. Finally, a proposition that is neither a tautology nor a contradiction is called a
contingency.
Tautologies and contradictions are often important in mathematical reasoning. The following table
illustrates examples of a tautology and a contradiction using just one proposition.

Table 1. Examples of a tautology and a contradiction.

p ¬p p∨¬ p p∧¬ p
T F T F
F T T F

Logical Equivalences
Compound propositions that have the same truth values in all possible cases are called logically
equivalent. We can also define this notion as follows: The propositions p and q are logically
equivalent if p↔ q is a tautology. The notation p⇔ q denotes that p and q are logically
equivalent.
One way to determine whether two propositions are equivalent is to use a truth table. In particular,
the propositions p and q are equivalent if and only if the columns giving their truth values agree. The
following example illustrates this method.

Example. Show that ¬( p∨q ) and ¬ p∧¬q are logically equivalent.

Solution: Construct truth tables for each of these propositions.

Table 2. Truth tables for ¬( p∨q ) and ¬p∧¬q .

p q p∨q ¬( p∨q ) ¬p ¬q ¬ p∧¬q
T T T F F F F
T F T F F T F
F T T F T F F
F F F T T T T

Since the truth tables of the propositions ¬( p∨q ) and ¬p∧¬q agree for all possible combinations
of the truth values of p and q, it follows that these propositions are logically equivalent.

Example. Show that the propositions p∨(q∧r ) and ( p∨q )∧( p∨r ) are logically equivalent. This
is the distributive law of disjunction over conjunction.
Solution: We construct the truth table for these propositions:

Table 3. A demonstration that p∨(q∧r ) and ( p∨q )∧( p∨r ) are logically equivalent.
p q r q∧r p∨(q∧r ) p∨q p∨r ( p∨q )∧( p∨r )
T T T T T T T T
T T F F T T T T
T F T F T T T T
T F F F T T T T
 F T T T T T T T
F T F F F T F F
F F T F F F T F
F F F F F F F F

Remark. A truth table of a compound proposition involving three different propositions requires
eight rows, one for each possible combination of truth values of the three propositions. In general, 2 n
rows are required if a compound proposition involves n propositions.

The following table contains important equivalences. In these equivalences, T denotes any
proposition that is always true and F denotes any proposition that is always false.

Table 4. Logical equivalences.

Equivalence Name
p∧T ⇔ p , p∨F ⇔ p Identity laws
p∨T ⇔T , p∧F ⇔ F Domination laws
p∧ p ⇔ p , p∨ p ⇔ p Idempotent laws
¬(¬p )⇔ p Double negation law
p∨q ⇔ q∨p , p∧q ⇔ q∧p Commutative laws
( p∨q )∨r ⇔ p∨( q∨r ) , ( p∧q )∧r ⇔ p∧( q∧r ) Associative laws
p∨(q∧r) ⇔( p∨q )∧( p∨r ) , p∧(q∨r )⇔( p∧q )∨( p∧r ) Distributive laws
¬( p∧q )⇔¬ p∨¬q , ¬( p∨q )⇔¬ p∧¬q De Morgan’s laws

We also have the following useful logical equivalences:

p∨¬p ⇔T , p∧¬p ⇔ F , p→ q ⇔¬ p∨q

Example. Show that ¬( p∨(¬ p∧q)) and ¬ p∧¬q are logically equivalent.
Solution: We could use a truth table to show that these compound propositions are equivalent.
Instead, we will establish this equivalence by developing a series of logical equivalence, using one of
the equivalences in Table 4 at a time, starting with ¬( p∨(¬ p∧q)) and ending with ¬ p∧¬q . We
have the following equivalences.
¬( p∨(¬ p∧q))⇔¬p∧¬(¬p∧q ) from the second De Morgan’s law
⇔¬p∧[¬(¬p )∨¬q ] from the first De Morgan’s law
⇔¬ p∧( p∨¬q ) from the double negation law
⇔(¬ p∧ p )∨(¬ p∧¬q ) from the distributive law
⇔ F∨(¬p∧¬q ) since ¬p∧p ⇔ F
⇔(¬ p∧¬q )∨F from the commutative law
⇔¬ p∧¬q from the identity law
Consequently, ¬( p∨(¬ p∧q)) and ¬ p∧¬q are logically equivalent.

Example. Show that ( p∧q )→( p∨q ) is a tautology.

Solution: To show that this statement is a tautology, we will use logical equivalences to demonstrate
that it is logically equivalent to T.
( p∧q )→( p∨q )⇔¬( p∧q )∨( p∨q ) by the logical equivalence p→ q ⇔¬ p∨q
⇔(¬ p∨¬q )∨( p∨q ) by the first De Morgan’s law
⇔(¬ p∨ p )∨(¬q∨q ) by the associative and commutative laws for disjunction
⇔T ∨T by Table 1 and the commutative law for disjunction
 by the domination law

Functionally complete collection of logical operators

Theorem. Suppose that a truth table in n propositional variables is specified. Then a compound
proposition with this truth table can be formed by taking the disjunction of conjunctions of the
variables or their negations, with one conjunction included for each combination of values for which
the compound proposition is true.
The resulting compound proposition is said to be in disjunctive normal form.
Example. Let the following table be given:
p q ¬p∨q
T T T
T F F
F T T
F F T
Then by Theorem ¬p∨q ⇔( p∧q )∨(¬ p∧q )∨(¬ p∧¬ q )
⇔( q∧( p∨¬ p ))∨(¬ p∧¬ q )
⇔q∨(¬ p∧¬ q )
⇔( q∨¬ p )∨(q∨¬ q )
⇔¬ p∨q
A collection of logical operators is called functionally complete if every compound proposition is
logically equivalent to a compound proposition involving only these logical operators.
Corollary. ¿¿ forms a functionally complete collection of logical operators.
Glossary
tautology – тавтология; contradiction – противоречие
contingency – случайность, непредвиденное обстоятельство

Exercises for Seminar 2

2.1. Use truth tables to verify the following equivalences.
a) p∧T ⇔ p ; b) p∨F ⇔ p ; c) p∨T ⇔T ; d) p∧F ⇔ F ; e) p∧ p ⇔ p ; f) p∨ p ⇔ p .
2.2. Use truth tables to verify the commutative laws: a) p∨q ⇔ q∨p ; b) p∧q ⇔ q∧p .
2.3. Use truth tables to verify the following:
a) p∧(q∨r ) ⇔( p∧q )∨( p∧r ) ; b) p↔ q ⇔( p →q )∧( q → p ) .
2.4. Show that each of the following implications is a tautology by using truth tables.
a) ( p∧q )→ p ; b) p→( p∨q) ; c) ¬ p→( p →q) ; d) ( p∧q )→( p→q ) ; e) ¬( p →q )→ p ;
f) [ ( p →q)∧( q →r )]→( p→r ) .
2.5. Show that each implication in Ex. 2.4 is a tautology without using truth tables.
2.6. Verify the following equivalences, which are known as the absorption laws:
a) [ p∨( p∧q )]⇔ p ; b) [ p∧( p∨q )]⇔ p .
2.7. Determine whether (¬ p∧( p→q ))→¬q is a tautology.
2.8. Show that p↔ q and ( p∧q )∨(¬p∧¬q ) are logically equivalent.
2.9. Show that p→ q and ¬q→¬ p are logically equivalent.
2.10. Find a compound proposition involving the propositions p, q and r that is true when p and q are
true and r is false, but is false otherwise.
2.11. Find a compound proposition involving the propositions p, q and r that is true when exactly
two of p, q and r are true and is false otherwise.
2.12. The following sentence is taken from the specification of a telephone system: “If the directory
database is opened, then the monitor is put in a closed state, if the system is not in its initial state.”
This specification is hard to understand since it involves two implications. Find an equivalent, easier-
to-understand specification that involves disjunctions and negations but not implications.

Exercise for Homework 2

2.13. Show that ¬(¬p) and p are logically equivalent.
2.14. Use truth tables to verify the associative laws:
a) ( p∨q )∨r ⇔ p∨( q∨r ) ; b) ( p∧q )∧r ⇔ p∧( q∧r ) .
2.15. Use truth tables to verify the equivalence: ¬( p∧q )⇔¬ p∨¬q .
2.16. Show that each of the following implications is a tautology by using truth tables.
a) [¬p∧( p∨q )]→q ; b) ¬( p →q )→¬q ; c) [ p∧( p→q ) ]→q ;
d) [( p∨q )∧( p →r )∧(q→r )]→r .
2.17. Show that each implication in Ex. 2.16 is a tautology without using truth tables.
2.18. Determine whether (¬q∧( p →q))→¬ p is a tautology.
2.19. Show that ( p →q )→r and p→( q →r ) are not logically equivalent.
2.20. Show that ¬( p ⊕ q) and p↔ q are logically equivalent.
2.21. Find a compound proposition involving the propositions p, q and r that is true when p and q are
false and r is true, but is false otherwise.
2.22. Find a compound proposition involving the propositions p, q and r that is false when p is false
and q and r are true, but is true otherwise.