Professional Documents
Culture Documents
Propositional Equivalence
(Section 1.2)
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007
1
PQ
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
3
Proof:
The left side and the right side must have the same truth
values independent of the truth value of the component
propositions.
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
4
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
7
Equivalence Name
(P V Q) V R Associative Law
P V (Q V R)
P V (Q R) Distributive Law
(P V Q) (P V R)
(P Q) P V Q De Morgan’s Laws
(P V Q) P Q
P Q P V Q Implication
Equivalence
P Q Q P Contrapositive Law
Note: equivalent expressions can always be substituted for each other in a more
complex expression - useful for simplification.
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
8
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
9
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
10
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
11
P Q R (P V Q) R
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
12
(P V Q) R
(P Q R) V (P Q R) V (P Q R)
V (P Q R) V (P Q R)
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
13
or
quantifying it
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
14
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
16
Universal
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
17
Example: U = {1, 2, 3}
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
18
Example: U={1,2,3}
x P(x) P(1) V P(2) V P(3)
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
19
Unique Existential
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1 How many
1 0 1 0 minterms are
1 1 0 0 in the DNF?
1 1 1 0
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
21
REMEMBER!
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
22
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
23
Outside in:
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
26
Example:
F(x): x is a fleegle
S(x): x is a snurd
T(x): x is a thingamabob
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
27
Everything is a fleegle
x F( x)
(x F(x))
Nothing is a snurd.
x S(x)
(x S( x))
No snurd is a thingamabob.
x [S(x) T(x)]
(x [S(x ) T(x)])
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
29
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
30
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
31
Commutativity of quantifiers
x y P(x, y) y x P( x, y)?
YES!
x y P(x, y) y x P(x, y)?
NO!
DIFFERENT MEANING!
Sets (1.6)
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
33
specification by predicates:
S= {x| P(x)},
S contains all the elements from U which make the predicate P
true.
Notation:
x is a member of S or x is an element of S:
x S.
x is not an element of S:
x S.
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
35
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
37
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
38
Example:
A = {,{}}.
A has two elements and hence four subsets:
, {}, {{}}. {,{}}
Note that is both a member of A and a subset of A!
Russell's paradox: Let S be the set of all sets which are not members
of themselves. Is S a member of itself?
CS 210, Ch.1 (part 2): The foundations: Logic & Proof, Sets, and Functions
39
Example:
A = {a,b}, B = {1, 2, 3}
AxB = {<a, 1>, <a, 2>, <a, 3>, <b, 1>, <b, 2>, <b, 3>}
What is BxA? AxBxA?