laws in disceret
TRANSCRIPT
Domination Lawsp ∨ T ≡ T p ∧ F ≡ F
Idempotent Lawsp ∨ p ≡ p p ∧ p ≡ p
Commutative Lawsp ∨ q ≡ q ∨ pp ∧ q ≡ q ∧ p
Identity Lawsp ∧ T ≡ p p ∨ F ≡ p
Double negation Law¬ (¬ p) ≡ p
Associative Laws(p ∨ q) ∨ r ≡ p ∨ (q ∨ r) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
p q r pq (p ∧ q) ∧ r
q ∧ r p ∧ (q ∧ r)
T T T T T T TT T F T F F FT F T F F F FT F F F F F FF T T F F T FF T F F F F FF F T F F F F
Distributive Lawsp ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
p q r q ∧ r
p∨ (q∧ r)
(p ∨ q)
(p ∨ r)
(p ∨ q) ∧ (p ∨ r)
T T T T T T T TT T F F T T T TT F T F T T T TT F F F T T T TF T T T T T T TF T F F F T F FF F T F F F T F
De Morgan’s Laws
qpqpqpqp
)()(
Negation Lawp ∨¬ p ≡ T p ∧¬ p ≡ F
Absorption Lawsp ∨ (p ∧ q) ≡ p p ∧ (p ∨ q) ≡ p
Simplifying Statement Formso ∼(∼p ∧ q) ∧ (p ∨ q)
≡ p
Exercise