Logical Equivalence 32 0

Law Memorization

Popularity (by total correct streak): 0
Popularity (by number of users): 0

Cards

 p ∧ T ≡ p ( Identity ) p ∨ F ≡ p ( Identity ) p ∨ T ≡ T ( Domination ) p ∧ F ≡ F ( Domination ) p ∨ p ≡ p ( Idempotent ) p ∧ p ≡ p ( Idempotent ) ¬(¬p) ≡ p ( Double Negation ) p ∨ q ≡ q ∨ p ( Commutative ) p ∧ q ≡ q ∧ p ( Commutative ) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r) ( Associative ) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) ( Associative ) p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) ( Distributive ) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) ( Distributive ) ¬(p ∧ q) ≡ ¬p ∨¬q ( De Morgan's 1st ) ¬(p ∨ q) ≡ ¬p ∧¬q ( De Morgan's 2nd ) p ∨ (p ∧ q) ≡ p ( Absorption ) p ∧ (p ∨ q) ≡ p ( Absorption ) p ∨¬p ≡ T ( Negation ) p ∧¬p ≡ F ( Negation ) p → q ≡ ¬p ∨ q p → q ≡ ¬q → ¬p p ∨ q ≡ ¬p → q p ∧ q ≡ ¬(p → ¬q) ¬(p → q) ≡ p ∧¬q (p → q) ∧ (p → r) ≡ p → (q ∧ r) (p → r) ∧ (q → r) ≡ (p ∨ q) → r (p → q) ∨ (p → r) ≡ p → (q ∨ r) (p → r) ∨ (q → r) ≡ (p ∧ q) → r p ↔ q ≡ (p → q) ∧ (q → p) p ↔ q ≡ ¬p ↔ ¬q p ↔ q ≡ (p ∧ q) ∨ (¬p ∧¬q) ¬(p ↔ q) ≡ p ↔ ¬q

Quisition is a browser-based flashcard system that repeats old cards and introduces new ones at optimal time intervals. You can create your own card packs or use those developed by others.