Scribd
Upload
357 views3 pages

DM Cheat Sheet

The document discusses key concepts in discrete mathematics including: 1) Logical equivalences such as identity laws, domination laws, and De Morgan's laws. 2) Field axioms including additive identity, additive inverse, and distributivity. 3) Rules of inference like modus ponens, modus tollens, and disjunctive syllogism. 4) Set identities involving unions, intersections, complements, and De Morgan's laws.

Uploaded by

Mohamed Ebrahem Khalifa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
357 views3 pages

DM Cheat Sheet

The document discusses key concepts in discrete mathematics including: 1) Logical equivalences such as identity laws, domination laws, and De Morgan's laws. 2) Field axioms including additive identity, additive inverse, and distributivity. 3) Rules of inference like modus ponens, modus tollens, and disjunctive syllogism. 4) Set identities involving unions, intersections, complements, and De Morgan's laws.

Uploaded by

Mohamed Ebrahem Khalifa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Discrete Mathematics

Logical Equivalences

• Identity laws p∧T≡p p∨F≡p

• Domination laws p∨T≡T p∧F≡F

• Idempotent laws p∨p≡p p∧p≡p

• Commutative laws p∨q ≡q∨p p∧q ≡q∧p

• Double-negation law ¬(¬p) ≡ p

• Associative laws
(p ∨ q) ∨ r ≡ p ∨ (q ∨ r) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r)

• Distributive laws
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)

• De Morgan’s laws
¬(p ∧ q) ≡ ¬p ∨ ¬q ¬(p ∨ q) ≡ ¬p ∧ ¬q

• More logical equivalences


p → q ≡ ¬p ∨ q p → q ≡ ¬q → ¬p p ∨ q ≡ ¬p → q
p ∧ q ≡ ¬(p → ¬q) p ↔ q ≡ (p → q) ∧ (q → p) p ↔ q ≡ ¬p ↔ ¬q

Field Axioms

1. ∀x (x + 0 = x) (Additive Identity)
2. ∀x ∃y (x + y = 0) (Additive Inverse)
3. ∀x ∀y (x + y = y + x) (Addition Commutativity)

4. ∀x ∀y ∀z (x + y) + z = x + (y + z) (Addition Associativity)
5. ∀x (1 · x = x) (Multiplicative Identity)
6. ∀x ∃y (x 6= 0 → x · y = 1) (Multiplicative Inverse)
7. ∀x ∀y (x · y = y · x) (Multiplication Commutativity)

8. ∀x ∀y ∀z (x · y) · z = x · (y · z) (Multiplication Associativity)

9. ∀x ∀y ∀z x · (y + z) = x · y + x · z) (Distributivity)
Discrete Mathematics

Rules of Inference

Modus Ponens Modus Tollens


1. p → q 1. p → q
2. p 2. ¬q
∴ q ∴ ¬p

Hypothetical Syllogism Disjunctive Syllogism


1. p→q 1. p∨q
2. q→r 2. ¬p
∴ p→r ∴ q

Addition Rule Simplification Rule


p p∧q
∴ p∨q ∴ p

Conjunction Rule Resolution Rule


1. p 1. p∨q
2. q 2. ¬p ∨ r
∴ p∧q ∴ q∨r

Universal Instantiation
∀xP (x)
∴ P (c) where c is a particular element of the domain

Universal Generalisation
P (c) for any arbitrary element c
∴ ∀xP (x)

Existential Instantiation
∃xP (x)
∴ P (c) for some element c

Existential Generalisation
P (c) for some particular element c
∴ ∃xP (x)
Discrete Mathematics

Set Identities

Let A, B, C be sets and U be the universal set which contains all objects under consider-
ation. In particular, each of A, B, C is a subset of U .

Identity Laws A∩U =A


A∪∅=A
Domination Laws A∪U =U
A∩∅=∅
Idempotent Laws A∪A=A
A∩A=A
Complementation Laws (A) = A

Commutative Laws A∪B =B∪A


A∩B =B∩A
Associative Laws A ∪ (B ∪ C) = (A ∪ B) ∪ C
A ∩ (B ∩ C) = (A ∩ B) ∩ C
Distributive Laws A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
Complement Laws A∪A=U
A∩A=∅
De Morgan’s Laws A∩B =A∪B
A∪B =A∩B

Discrete Mathematics Logical Equivalences • Identity laws p ∧T ≡p p ∨F ≡p • Domination laws p ∨T ≡T p ∧F ≡F • Idempotent laws
Discrete Mathematics Rules of Inference Modus Ponens Modus Tollens 1. p →q 2. p ∴ q 1. p →q 2. ¬q ∴ ¬p Hypothetical Syllogism
Discrete Mathematics Set Identities Let A, B, C be sets and U be the universal set which contains all objects under consider-

You might also like