Laws of Equivalence Flashcards

1
Q

P ↔ P

A

Reflexitivity

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

~(~P) ↔ P

A

Double Negation

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

(P ∧ Q) ↔ (Q ∧ P)
(P ∨ Q) ↔ (Q ∨ P)
(P ↔ Q) ↔ (Q ↔ P)

A

Commutativity

(The position of the propositions can be interchanged, given that they are connected via conjunction (‘AND’ ^), disjunction (‘OR’ V), or biconditional (‘IF AND ONLY IF’)

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

[(P ∧ Q) ∧ R] ↔ [P ∧ (Q ∧ R)]
[(P ∨ Q) ∨ R] ↔ [P ∨ (Q ∨ R)]
[(P ↔ Q) ↔ R] ↔ [P ↔ (Q ↔ R)]

A

Associativity

(The groupings of the propositions can be interchanged, given that they are all connected with the same logical connectives, which can be a conjunction (‘AND’ ^), disjunction (‘OR’ V), or biconditional (‘IF AND ONLY IF’)

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

(P ∧ P) ↔ P
(P ∨ P) ↔ P

A

Idempotency

(A proposition conjoined or disjoined to itself, is just the preposition itself)

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

(P ∧ T) ↔ P
(P ∨ F) ↔ P

A

Identity

(A proposition conjoined with to True statement is just the proposition itself since it will be the one to dictate the overall truth value of the compound preposition.)

(The same reasoning applies when a proposition is disjoined to False)

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

(P ∧ ~P) ↔ F
(P ∨ ~P) ↔ T

A

Inverse

(A proposition conjoined with the negation of itself will always be FALSE)

(While a proposition disjoined to its negation will always be TRUE)

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

(P ∧ F) ↔ F
(P ∨ T) ↔ T

A

Dominance

(A proposition does not hold any power in changing the Truth Value of the compound proposition)

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

[P ∧ (P ∨ Q)] ↔ P
[P ∨ (P ∧ Q)] ↔ P

A

Absorption

A proposition (P) conjoined to a disjunction of itself to another proposition is just the proposition itself

The same can be said whenever P is disjoined to a conjunction of itself to another proposition.

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

~(P ∧ Q) ↔ (~P ∨ ~Q)
~(P ∨ Q) ↔ (~P ∧ ~Q)

A

De Morgan’s Law

Negation can be distributed to the propositions inside the parenthesis, but the conjunction will be changed to a disjunction and vice versa.

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

(P →Q) ↔ (~Q → ~P)

A

Contrapositive

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

(P →Q) ↔ (~P ∨ Q)

A

Material Implication

P implies Q is just equal to the negation of the premise (P) disjoined to its conclusion (Q).

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

(P ↔Q) ↔ [(P → Q) ∧ (Q → P)]
(P ↔Q) ↔ [(P ∧ Q) ∨ (~P ∧ ~Q)]

A

Material Equivalence

P if and only if Q is just equal to P implies Q or Q implies P

It is also just equal to P and Q or not P and not Q.

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

[(P ∧ Q) → R] ↔ [P → (Q → R)]

A

Exportation

(P and Q) implies R is just equal to P implies (Q implies R).

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