Laws of Equivalence Flashcards
P ↔ P
Reflexitivity
~(~P) ↔ P
Double Negation
(P ∧ Q) ↔ (Q ∧ P)
(P ∨ Q) ↔ (Q ∨ P)
(P ↔ Q) ↔ (Q ↔ P)
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’)
[(P ∧ Q) ∧ R] ↔ [P ∧ (Q ∧ R)]
[(P ∨ Q) ∨ R] ↔ [P ∨ (Q ∨ R)]
[(P ↔ Q) ↔ R] ↔ [P ↔ (Q ↔ R)]
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’)
(P ∧ P) ↔ P
(P ∨ P) ↔ P
Idempotency
(A proposition conjoined or disjoined to itself, is just the preposition itself)
(P ∧ T) ↔ P
(P ∨ F) ↔ P
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)
(P ∧ ~P) ↔ F
(P ∨ ~P) ↔ T
Inverse
(A proposition conjoined with the negation of itself will always be FALSE)
(While a proposition disjoined to its negation will always be TRUE)
(P ∧ F) ↔ F
(P ∨ T) ↔ T
Dominance
(A proposition does not hold any power in changing the Truth Value of the compound proposition)
[P ∧ (P ∨ Q)] ↔ P
[P ∨ (P ∧ Q)] ↔ P
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.
~(P ∧ Q) ↔ (~P ∨ ~Q)
~(P ∨ Q) ↔ (~P ∧ ~Q)
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.
(P →Q) ↔ (~Q → ~P)
Contrapositive
(P →Q) ↔ (~P ∨ Q)
Material Implication
P implies Q is just equal to the negation of the premise (P) disjoined to its conclusion (Q).
(P ↔Q) ↔ [(P → Q) ∧ (Q → P)]
(P ↔Q) ↔ [(P ∧ Q) ∨ (~P ∧ ~Q)]
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.
[(P ∧ Q) → R] ↔ [P → (Q → R)]
Exportation
(P and Q) implies R is just equal to P implies (Q implies R).