Scribd
Upload
8 views

PropositionalEquiv Class1

PropositionalEquiv_Class1

Uploaded by

osmani.acs22
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

PropositionalEquiv Class1

PropositionalEquiv_Class1

Uploaded by

osmani.acs22
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Prop. Equiv.

Propositional Equivalences

Def. A compound proposition that is always true, no matter what the truth
values of the (simple) propositions that occur in it, is called tautology. A
compound proposition that is always false, no matter what, is called a
contradiction. A proposition that is neither a tautology nor a contradiction
is called a contingency.

Examples: Let p be a proposition. Indicate whether the propositions are:


(A) tautologies (B) contradictions or (C) contingencies.
Proposition type
p p
p p
p p

Definition. The propositions p and q are called logically equivalent if


p q is a tautology. The notation p q denotes that p and q are logically
equivalent. Some text books use the notation p q to denote that p and q
are logically equivalent.

Objective of the section:

You must learn to determine if two propositions are logically equivalent by


the
truth table method and
by the logical proof method using the tables of logical equivalences (but
not true tables)

Exercise 1: Use truth tables to show that p p (the double negation


law) is valid.

Exercise 2: Use truth tables to show that p T p (an identity law) is


valid.
Prop. Equiv. 2

Note: Any equivalence termed a “law” will be proven by truth table, but
all others by proof (as we shall see next).

Equivalence Name
p T p Identity laws
p F p
p T T Domination laws
p F F
p p p Idempotent laws
p p p
p p Double negation law
p q q p Commutative laws
p q q p
( p q ) r p ( q r) Associative laws
(p q) r p (q r)
p (q r) (p q) (p r) Distributive laws
p (q r) (p q) (p r)
(p q) p q De Morgan's laws
(p q) p q
p p T Negation laws
p p F
(p q) p q Other useful logical equivalence
(p q) q p

Exercise 3: State the name of the law used in the identity


i. ( p q) T T ___________________
ii. T ( p q) ( p q) T ___________________
ii. ( p q) F ( p q) ___________________
iii. ( p q) T ( p q) ___________________
iv. ( p q) p q ___________________

Exercise 4: Without truth tables to show that


( p q) p q

Exercise 5: Without truth tables to show that


[ (p q) (p q) ] T
Prop. Equiv. 3

Exercise 6: Without truth tables to show that


p (p q) p q

Exercise 7: Without truth tables to show that


(p ( p q)) (p q)

Exercise 8: Without truth tables to show that ( p q) p q.


Prop. Equiv. 4

Exercise 9: Without truth tables to show that (p q) p q.

Exercise 10: Without truth tables to show that ( p (p q)) q is a


tautology.

Exercise 11: Without truth tables to show that an implication and it’s
contrapositive are logically equivalent.

Applications
In addition to providing a foundation for theorem proving, which we will
cover in this class, this algebraic look at logic can be studied further for the
purpose of discussion computer program correctness.

You might also like