Unit 1: Propositional Logic and

Set Theory

Part 2
 Compound (complex) proposition
 Conditional proposition and its Converse,
Inverse, and Contrapositive
 Compound (or complex) propositions
  How to form propositions involving more than one connective, and how to determine the truth values
of such propositions?
Definition:
 The proposition formed by joining two or more proposition by connective(s) is called a compound
statement.
Note: We must be careful to insert the brackets in proper places
 or are very different propositions.
 The possible truth values of a proposition are often listed in a table, called a truth table.
 A truth table involving “n” propositions p1,p2,…,pn contains 2n possible combinations of truth values.
  A truth table involving “2” propositions p and q has 2n=22=4 possible truth
value combinations
 A truth table involving “3” propositions p,q, and r has 2n=23=8 possible truth
value combinations Sn p q r
Sn p q 1 T T T
1 T T 2 T T F

2 3 T F T
T F
2 =4
2
4 T F F
3 T
F
23=8 5 F T T
4
F F
6 F T F
7 F F T
8 F F F
Example:

1.   Suppose p and r are T and q and s are F. What is the truth value of ?
 First let’s do it all for exercise purpose.

p q r s rs t z
T T T T T T T T T T

T F F T F T T T
T F
F T
F
F
F T F F T T T F
F T
T T
F
T
F F F F F F T F
F F
F F
T

 Since p is true and q is false, is false. (: F)

 Since r is true and s is false, is true. ()
 Thus by applying the rule of implication, we get that F T
 F T is true.
Remark:

  When dealing with compound propositions, we shall adopt the following
convention on the use of parenthesis.
 Whenever “” or “” occur with “” or “ ”, we shall assume that “” or “” is
applied first, and then “” or “ ” is then applied.
Definition: Equivalent Compound Propositions

  Two compound propositions P and Q are said to be equivalent if they have the
same truth value for all possible combinations of truth values for the component
propositions occurring in both P and Q
 In this case we write P Q (Last two Columns are identical) / Otherwise P Q
Example: Let P: p q and Q: q p

p q p P qQp
T T F F T   T
T F F T F Hence F
F T T F T PQ T
F F T T T T
 Converse, Inverse, and Contrapositive of Conditional Proposition
  
 Conditional Statement: if p (hypothesis), then q (Conclusion).

1. Converse of if p, then q is if q, then p.

 Hypothesis becomes Conclusion and Conclusion becomes Hypothesis

2. Inverse of if p, then q is if not p, then not q.

 Hypothesis becomes Negation Hypothesis and Conclusion becomes

Negation Conclusion
3. Contrapositive of if p, then q is if not q, then not p.
:
 Hypothesis becomes Negation Conclusion and Conclusion becomes
Negation Hypothesis
Example: If Kidist lives in Addis Ababa, then she lives in Ethiopia.

Converse:
 If Kidist lives in Ethiopia, then she lives in Addis Ababa.
Contrapositive:
 If Kidist does not live in Ethiopia, then she does not live in Addis Ababa.
Inverse:
 If Kidist does not live in Addis Ababa, then she does not live in Ethiopia.
 Equivalence and Non-Equivalence Cases
p q p Conditional

T T F F T T T T t z
T T T
T F F T F T T F
T F F
F T T F T F F T F T T

F F T T T T T T F F T

 Now Check for equivalence

 Conditional and Contrapositive are equivalent
 Converse and Inverse are equivalent
• Propositions, under the relation of logical
equivalence, satisfy various laws or identities


  Given: p=T , q=F, and r=T

1. Idempotent Laws:
: :
: :
2. Commutative laws:
: :
: :
Cont…

3.  Associative Laws
A.

B.

4. Distributive laws
A. ()
B. ()
5. De Morgan’s Laws
A.

B.

6. Law of contrapositive
A. )
7. Complement Law
A.