Scribd
Upload
27 views

Lecture 3

This document discusses key concepts in propositional logic including contingencies, propositional equivalences, and the inverse, converse, and contrapositive of conditional statements. It provides examples to illustrate each concept. Specifically, it explains that a contingency is a formula that can be both true and false, two statements are equivalent if they have the same truth values, and the inverse, converse, and contrapositive of a conditional statement "if p then q" are ¬p→¬q, q→p, and ¬q→¬p respectively.

Uploaded by

AIMAN SUBHAN
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
27 views

Lecture 3

This document discusses key concepts in propositional logic including contingencies, propositional equivalences, and the inverse, converse, and contrapositive of conditional statements. It provides examples to illustrate each concept. Specifically, it explains that a contingency is a formula that can be both true and false, two statements are equivalent if they have the same truth values, and the inverse, converse, and contrapositive of a conditional statement "if p then q" are ¬p→¬q, q→p, and ¬q→¬p respectively.

Uploaded by

AIMAN SUBHAN
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Discrete Structure

Numan Ali
Lecturer in Department of Computer Games Development, Air
University Islamabad

1
Propositional Logic
 Contingency

 A Contingency is a formula which has both some


true and some false values for every value of its
propositional variables.

 Example − Prove (A∨B)∧(¬A) a contingency

2
Propositional Logic
 The truth table is as follows:

 As we can see every value of (A∨B)∧(¬A) has


both “True” and “False”, it is a contingency.

3
Propositional Logic
 Propositional Equivalences

 Two statements X and Y are logically equivalent if


any of the following two conditions hold:

 The truth tables of each statement have the same


(matching/equal) values.

 The bi-conditional statement X⇔Y is a tautology.

4
Propositional Logic
 Propositional Equivalences

 Example − Prove ¬(A∨B) and [(¬A)∧(¬B)] are


equivalent.

 In the example here are two statements:

 ¬(A∨B)
 [(¬A)∧(¬B)]

5
Propositional Logic
 The truth table is as follows:
 Testing by 1st method (Matching truth table)

 Here, we can see the truth values of


¬(A∨B)and[(¬A)∧(¬B)] are same, hence the statements
are equivalent.

6
Propositional Logic
 Testing by 2nd method (Bi-conditionality)

 As [¬(A∨B)]⇔[(¬A)∧(¬B)] is a tautology, the


statements are equivalent.

7
Propositional Logic
 Inverse, Converse, and Contra-positive

 Implication/if-then (→) is also called a


conditional statement. It has two parts:

 Hypothesis, p
 Conclusion, q

 As mentioned earlier, it is denoted as p→q

8
Propositional Logic
 Example of Conditional Statement

 “If you do your homework, you will not be


punished.”

 Here, "you do your homework" is the hypothesis,


‘p’.

 and "you will not be punished" is the conclusion,


‘q’.

9
Propositional Logic
 Inverse
 An inverse of the conditional statement is the

negation of both the hypothesis and the


conclusion.

 If the statement is “If p, then q”, the inverse will


be “If not p, then not q”.

 The inverse of p→q is ¬p→¬q.

10
Propositional Logic
 Example of Inverse

 The inverse of “If you do your homework, you will


not be punished” is:

 “If you do not do your homework, you will be


punished.”

 Thus the inverse of p→q is ¬p→¬q.

11
Propositional Logic
 Converse

 The converse of the conditional statement is


computed by interchanging the hypothesis and
the conclusion.

 If the statement is “If p, then q”, the converse will


be “If q, then p”.

 The converse of p→q is q→p.

12
Propositional Logic
 Example

 The converse of "If you do your homework, you


will not be punished" is:

 "If you will not be punished, you do your


homework”.

 Thus the converse of p→q is q→p.

13
Propositional Logic
 Contra-positive

 The contra-positive of the conditional is


computed by interchanging the hypothesis and
the conclusion of the inverse statement.

 If the statement is “If p, then q”, the contra-


positive will be “If not q, then not p”.

 The contra-positive of p→q is ¬q→¬p.

14
Propositional Logic
 Example

 The Contra-positive of " If you do your


homework, you will not be punished” is:

 "If you are punished, you did not do your


homework”.

 Thus the contra-positive of p→q is ¬q→¬p.

15

You might also like