Loading...
Discussion 0A
Ming Li
mingyli@berkeley.edu
OH: Th 3 to 4pm in Soda 651
Discussion: TuTh 5 to 6pm in Dwinelle 105
Logistics: Piazza and
sp19@eecs70.org
Introductions
your name
one interesting thing you did over break
one movie you are embarrassed to have not seen yet
Review
Propositional Logic
proposition
: statement that evaluates to true or false
conjunction
:
P
∧
Q
P \land Q
P
∧
Q
,
P
a
n
d
Q
P \text{ and } Q
P
and
Q
disjunction
:
P
∨
Q
P \lor Q
P
∨
Q
,
P
o
r
Q
P \text{ or } Q
P
or
Q
negation
:
¬
P
\lnot P
¬
P
,
n
o
t
P
\text{not } P
not
P
implication
:
P
⇒
Q
P \Rightarrow Q
P
⇒
Q
,
¬
P
∨
Q
\lnot P \lor Q
¬
P
∨
Q
when
P
P
P
is false, the implication is true regardless of
Q
Q
Q
. this is called a vacuous statement
h
y
p
o
t
h
e
s
i
s
⇒
c
o
n
c
l
u
s
i
o
n
\text{hypothesis} \Rightarrow \text{conclusion}
hypothesis
⇒
conclusion
given an implication
P
⇒
Q
P \Rightarrow Q
P
⇒
Q
contrapositive
:
¬
Q
⇒
¬
P
\lnot Q \Rightarrow \lnot P
¬
Q
⇒
¬
P
has the same truth value
(
P
⇒
Q
)
≡
(
¬
P
∨
Q
)
≡
(
Q
∨
¬
P
)
≡
(
¬
Q
⇒
¬
P
)
(P \Rightarrow Q) \equiv (\lnot P \lor Q) \equiv (Q \lor \lnot P) \equiv (\lnot Q \Rightarrow \lnot P)
(
P
⇒
Q
)
≡
(
¬
P
∨
Q
)
≡
(
Q
∨
¬
P
)
≡
(
¬
Q
⇒
¬
P
)
converse
:
Q
⇒
P
Q \Rightarrow P
Q
⇒
P
not necessarily the same truth value
P
≡
Q
P \equiv Q
P
≡
Q
means both
P
⇒
Q
P \Rightarrow Q
P
⇒
Q
and
Q
⇒
P
Q \Rightarrow P
Q
⇒
P
Quantifiers
universal quantifier
:
∀
\forall
∀
, for all
∀
x
P
(
x
)
\forall x P(x)
∀
x
P
(
x
)
is whether
P
(
x
)
P(x)
P
(
x
)
evaluates to true for all values of
x
x
x
existential quantifier
:
∃
\exists
∃
, there exists
∃
x
P
(
x
)
\exists x P(x)
∃
x
P
(
x
)
is whether
P
(
x
)
P(x)
P
(
x
)
evaluates to true for some value of
x
x
x
Negation
¬
(
P
∧
Q
)
≡
(
¬
P
∨
¬
Q
)
\lnot (P \land Q) \equiv (\lnot P \lor \lnot Q)
¬
(
P
∧
Q
)
≡
(
¬
P
∨
¬
Q
)
¬
(
P
∨
Q
)
≡
(
¬
P
∧
¬
Q
)
\lnot (P \lor Q) \equiv (\lnot P \land \lnot Q)
¬
(
P
∨
Q
)
≡
(
¬
P
∧
¬
Q
)
¬
(
∀
x
P
(
x
)
)
≡
∃
x
¬
P
(
x
)
\lnot (\forall x P(x)) \equiv \exists x \lnot P(x)
¬
(
∀
x
P
(
x
)
)
≡
∃
x
¬
P
(
x
)
¬
(
∃
x
P
(
x
)
)
≡
∀
x
¬
P
(
x
)
\lnot (\exists x P(x)) \equiv \forall x \lnot P(x)
¬
(
∃
x
P
(
x
)
)
≡
∀
x
¬
P
(
x
)
Please turn on JavaScript to use Paper in all of its awesomeness. ^_^
Introductions
Review
Propositional Logic
Quantifiers
Negation