This document discusses chapter 2 of the course AAMS3653 Discrete Mathematics. It covers the basics of logic, including statements, truth values, logical connectives like conjunction and disjunction, and truth tables. It defines logical concepts like tautology, contradiction and contingency. It also discusses equivalence between logical statements and important logical equivalence laws.
This document discusses chapter 2 of the course AAMS3653 Discrete Mathematics. It covers the basics of logic, including statements, truth values, logical connectives like conjunction and disjunction, and truth tables. It defines logical concepts like tautology, contradiction and contingency. It also discusses equivalence between logical statements and important logical equivalence laws.
This document discusses chapter 2 of the course AAMS3653 Discrete Mathematics. It covers the basics of logic, including statements, truth values, logical connectives like conjunction and disjunction, and truth tables. It defines logical concepts like tautology, contradiction and contingency. It also discusses equivalence between logical statements and important logical equivalence laws.
This document discusses chapter 2 of the course AAMS3653 Discrete Mathematics. It covers the basics of logic, including statements, truth values, logical connectives like conjunction and disjunction, and truth tables. It defines logical concepts like tautology, contradiction and contingency. It also discusses equivalence between logical statements and important logical equivalence laws.
Logic ➢ Deals with the methods of reasoning. It provides rules and techniques for determining whether a given argument is valid.
Statements ➢ A declarative sentence that is either true or false but not both. ➢ The truthfulness or falsity of a statement is called its truth value. ➢ True represented by T or 1. ➢ False represented by F or 0.
Eg 1: Identify the statements.
a) The earth is round. b) 2 + 3 = 6. c) Ms Lee is fat and short. d) Segamat is located in Seremban. e) Take two aspirins. f) The sun will come out tomorrow. g) What time is it ? h) x + 1 = 2. i) Read this carefully. j) x + y = z.
➢ Letters like p, q, r, s or P, Q, R, S are used to denote
prepositional variables. ➢ A true statement has truth value T.
23 AAMS3653 Discrete Mathematics
➢ A false statement has truth value F.
➢ If P is true, then P is false. ➢ If P is false, then P is true.
Eg 2: R : The earth is round has truth value
S : 2 + 3 = 6 has truth value
➢ Statement can be combined by logical connectives
• “ and or conjunction” (Symbol ), • “ or or disjunction” (Symbol ), • “ not or negation” (Symbol or ),
➢ The truth value depends on the types of connectives
used.
Truth Table
❖ a table giving the truth values of a compound statement
in terms of the truth values of its component parts. ❖ Each component statement has 2 possible truth values, T and F. ❖ If there are n component statements in the compound statements, then the number of rows in its truth table is 2n.
Types of Connectives 1) Conjunction ( and, ) Let P and Q be two simple statements, the conjunction of P and Q is the compound statement P and Q (P Q). It is true when both P and Q are true.
Eg 3: R S means the conjunction of R and S is “The
earth is round and 2 + 3 = 6”.
24 AAMS3653 Discrete Mathematics
Truth table for P Q
P Q PQ T T T F F T F F
2) Disjunction ( or, ) The compound statement is true if a t least one of P or Q is true.
Eg 4: R S means the disjunction of R and S is “ The
earth is round or 2 + 3 = 6” Truth table for P Q P Q PQ T T T F F T F F
3) Negation ( not, , ) P is true when P is false.
Eg 5: S means the negation of S is “ It is not the case
that 2 + 3 = 6” or 2 + 3 6. Truth table for negation P P T F
25 AAMS3653 Discrete Mathematics
4) Implication ( if…then…, →) The implication p→q is the proposition that is false when p is true and q is false. In this implication p is called the hypothesis (premise) and q is called the conclusions (consequence).
Truth table for P→Q
P Q P→Q T T T F F T F F
Eg 6: “If I am your lecturer, then you all are my students” is
obviously true.
“If I am your lecturer, then you all are my children” is
false since the conclusion is false.
5) Biconditional Statement ( if and only if, iff, )
If P→Q and Q→P, we write PQ and read as P if and only if (iff) Q. It is true only when both P and Q have the same truth values. PQ = (P→Q) (Q→P)
Truth table for PQ
26 AAMS3653 Discrete Mathematics
P Q PQ (P→Q)(Q→P) T T T F F T F F
Tautology ➢ A proposition that is always true whatever the truth values of the component statements. ➢ The last column of the truth table consists of T only.
Eg 8: P P P P P T F
Contradiction ➢ A proposition that is always false whatever the truth values of the component statements. ➢ The last column of the truth table consists of F only.
Eg 9: P P P P P T F
27 AAMS3653 Discrete Mathematics
Contingency ➢ A proposition that can be either true (T) or false (F), depending on the truth values of its component statements.
Eg 10: (P Q)
P Q (P Q) T T T F F T F F
❖ The order of evaluating the truth values of an expression
is ( ), , , , →, .
Eg 11: Show that (P→Q) (Q→R) →(P→R) is tautology.
Eg 12: Verify if the following are tautology, contradiction or
➢ The inverse of P → Q is the implication P → Q. ➢ The contrapositive of P → Q is the implication Q → P. ➢ The negation of P → Q is P Q.
Eg 13: Give the converse, inverse, contrapositive and
negation of the implication “If it is raining, then I get wet.”
Eg 14: p = I am hardworking. q = I am successful.
p → q:
q → p:
29 AAMS3653 Discrete Mathematics
p → q:
q → p:
(p → q):
Logical Equivalence ( or ) ➢ Two statements are considered to be equivalent if they have the same truth value for any combination of truth values of their component statements. ➢ The last column of their truth table is identical. This means the biconditional statement of two logically equivalent.
Eg 15: Show that P (Q R) and (P Q) (P R) are
logically equivalent.
30 AAMS3653 Discrete Mathematics
Below are some important equivalence and their names.
1) P T P Identity laws PFP
2) P T T Domination laws PFF
3) P P P Idempotent laws PPP 4) (P) P Double negation
5) P Q Q P Commutative laws PQQP
6) P (Q R) (P Q) R Associative laws P (Q R) (P Q) R
