Scribd
Upload
9 views

01-Introduction-Chapter01-Propositional Logic (EX)

Uploaded by

120574win
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
9 views

01-Introduction-Chapter01-Propositional Logic (EX)

Uploaded by

120574win
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 40

DISCRETE

MATHEMATICS
AND
ITS
APPLICATIONS
Book: Discrete Mathematics and Its
Applications
Author: Kenneth H. Rosen
Sixth Edition
McGraw-Hill International Edition
Chapter 1
The Foundations:
Logic and Proofs
Logical Operators (connective)

 Negation p (NOT)

 Conjunction p^q (AND/BUT)


 Disjunction pvq (OR)
 Exclusive-or “p
por q (XOR)
q (but not
both)”
Logical Operators (connective)
- If p, then q
- q if p
Implication p→q - p only if q
- p is sufficient condition for q
- q is necessary condition for p

p → q is false when p is true and q is false, and true otherwise.

 Biconditional pq (if and only if)


p  q is true when p and q have the same truth values,
and is false otherwise.
1.1.2- Precedence of Logical Operators

(1) Parentheses from inner to outer


(2) ¬
(3) ^
(4) v
(5) →
(6) ↔
 Ex: p ^ q → r v s means [(p) ^ q] → (r v s)

n
A truth table will need 2 rows if there are n variables.
1 1.1
2 1.1
1.1 Propositional
Logic
3. Construct a truth table for each of these compound
propositions.
a) p ∨ ¬p
b) (p ∨ q) → (p ∧ q)
c) (q → ¬p) ↔ (p ↔ q)
d) (p ⊕ q) → (p ∧ q)
4 1.1
5 1.1

- p is sufficient condition for q


6 1.1
7 1.1
8 1.1
9 1.1
1.1 Propositional Logic
10. How many rows appear in a truth table for each
of these compound propositions?

21 2 rows
2
2 4 rows
23 8 rows
n
A truth table will need 2 rows if there are n variables.
11 1.1
12 1.1
1.1 Propositional Logic
13. Evaluate each of these expressions.
a) 1 1000 ∧ (0 1011 ∨ 1 1011)
b) (0 1111 ∧ 1 0101) ∨ 0 1000
c) (0 1010 ⊕ 1 1011) ⊕ 0 1000
d) (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011)
14 1.1
15 1.1
 Tautology is a proposition that is always true.
 Contradiction is a proposition that is always false.
 p q when p ↔ q is tautology.
Equivalence Name
¬(p^q) ≡ ¬p v ¬q ¬(pvq) ≡ ¬p^¬q De Morgan Laws
16 1.2
17 1.2
18. Show that p → q and ¬q → ¬p are logically equivalent.
19 1.2
20 1.2
Quantifier
Predicate Proposition
- Universal quantification: "all of," "for each," "given any," "for arbitrary,“
- Existential quantification: "there exists”, "for some," "for at least one," or "there is."
21 1.3
22 1.3
23 1.3
24 1.3
25 1.3
1.5.2 - Rules Inferences
Rule Name Rule Name
p Modus ponen p Addition
p →q pvq
q
¬q Modus tollen p^q Simplication
p→q p
¬p

p →q Hypothetical p Conjunction
q →r syllogism q
p →r p^q

pvq Disjunctive pvq Resolution


¬p syllogism ¬pvr
q qvr
1.5.4 - Rules of Inference
for Quantified Statements
Rule Name
xP(x) Universal Instantiation
P(c)
P(c) for arbitrary c Universal generalization
xP(x)
xP(x) Existential instantiation
P(c) for some element c
P(c) for some element c Existential generalization
xP(x)
1.5 - Rules of Inference
26. What rule of inference is used in each of these arguments?
a) Alice is a mathematics major. Therefore,
Alice is either a mathematics major or a
computer science major.

b) Jerry is a mathematics major and a


computer science major. Therefore, Jerry
is a mathematics major.

c) If it is rainy, then the pool will be closed.


It is rainy. Therefore, the pool is closed.
1.5 - Rules of Inference
26. What rule of inference is used in each of these arguments?

d) If it snows today, the university will close.


The university is not closed today. Therefore,
it did not snow today.

e) If I go swimming, then I will stay in the sun


too long. If I stay in the sun too long, then I will
sunburn. Therefore, if I go swimming, then I
will sunburn.
1.5 - Rules of Inference
27. Use rules of inference to show that the hypotheses “Randy
works hard,” “If Randy works hard, then he is a dull boy,” and
“If Randy is a dull boy, then he will not get the job” imply the
conclusion “Randy will not get the job.”
1.5 - Rules of Inference
28. For each of these arguments determine whether the argument
is correct or incorrect and explain why.
a) All students in this class understand logic. Xavier is a student
in this class. Therefore, Xavier understands logic.
29 1.5
30 1.5

You might also like