Logical Equivalences Flashcards

1
Q

Domination Laws

A

P ∨ T = T

P ∧ F = F

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

Idempotent Laws

A

P ∨ P = P

P ∧ P = P

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

Double Negation Law

A

¬(¬P) = P

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

Commutative Law

A

P ∨ Q = Q ∨ P

P ∧ Q = Q ∧ P

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

Associative Law

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
6
Q

Distributive Law

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
7
Q

DeMorgan’s Laws

A

¬(P ∧ Q) = ¬P ∨ ¬Q

¬(P ∨ Q) = ¬P ∧ ¬Q

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

Absorption Laws

A

P ∨ (P ∧ Q) = P

P ∧ (P ∨ Q) = P

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

Negation Law

A

P ∨ ¬P = T

P ∧ ¬P = F

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

Identity Laws

A

P ∨ F = P

P ∧ T = P

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

Universal Instantiation

A

∀xP(x)

∴P(c)

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

Universal Generalization

A

P(c) for arbitrary c

∴∀xP(x)

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

Existential Instantiation

A

∃xP(x)

∴P(c) for some element c

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

Existential Generalization

A

P(c) for some element c

∴∃xP(x)

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

Universal Modus Ponens

A

∀x(P(x)→Q(x))
P(a), where a is particular element in the domain
∴Q(a)

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

Universal Modus Tollens

A

∀x(P(x)→Q(x))
¬Q(a), where a is a particular element in domain
∴¬P(a)