Logical Proofs - Valid Equivalence Arguments Flashcards

1
Q

Double Negation (DN):

A

p :: ~ ~ p

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

p :: ~ ~ p

A

Double Negation (DN):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

DeMorgan’s Theorem (DeM):

A

~ (p . q) :: ~ p ∨ ~ q

~ ( p ∨ q) :: ~ p . ~ q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

~ (p . q) :: ~ p ∨ ~ q

~ ( p ∨ q) :: ~ p . ~ q

A

DeMorgan’s Theorem (DeM):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Commutation (Comm):

A

p ∨ q :: q ∨ p

p . q :: q . p

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

p ∨ q :: q ∨ p

p . q :: q . p

A

Commutation (Comm):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Association (Assoc):

A

p ∨ (q ∨ r) :: (p ∨ q) ∨ r

p . (q . r) :: (p . q) . r

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

p ∨ (q ∨ r) :: (p ∨ q) ∨ r

p . (q . r) :: (p . q) . r

A

Association (Assoc):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Distribution (Dist):

A

p . (q ∨ r) :: (p . q) ∨ (p . r)

p ∨ (q . r) :: (p ∨ q) . (p ∨ r)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

p . (q ∨ r) :: (p . q) ∨ (p . r)

p ∨ (q . r) :: (p ∨ q) . (p ∨ r)

A

Distribution (Dist):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Contraposition (Contra):

A

p ⊃ q :: ~ q ⊃ ~ p

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

p ⊃ q :: ~ q ⊃ ~ p

A

Contraposition (Contra):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Implication (Impl):

A

p ⊃ q :: ~ p ∨ q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

p ⊃ q :: ~ p ∨ q

A

Implication (Impl):

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Exportation (Exp):

A

(p . q) ⊃ r :: p ⊃ (q ⊃ r)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

(p . q) ⊃ r :: p ⊃ (q ⊃ r)

A

Exportation (Exp):

17
Q

Tautology (Taut):

A

p :: p . p
p :: p ∨ p

18
Q

p :: p . p
p :: p ∨ p

A

Tautology (Taut):

19
Q

Equivalence (Equiv):

A

p ≡ q :: (p ⊃ q) . (q ⊃ p)
p ≡ q :: (p . q) ∨ (~ p . ~ q)

20
Q

p ≡ q :: (p ⊃ q) . (q ⊃ p)
p ≡ q :: (p . q) ∨ (~ p . ~ q)

A

Equivalence (Equiv):

21
Q

Rules of Equivalence:

A

Bi-directional

22
Q

Rules of Equivalence ______ be used with a single part of a statement

A

CAN