Circuits

p and q (p ^ q) p or q (p v q)
p
p q
q

Illustration of circuits representing the following:

1. (not p and not q) and not r

~p ~q ~r

2. (not q and not r) or (not p or not r)

~q ~r
3.

4. ~p
5.
6.
7. ~r
8.
3. [(not p or not r) or not q] and (not p and r)

~p

~r
~p r

~q

4. (p and q) or (p and r)

p q

p r

5. p and (q or r)

q
p
r
Sets – Collection of well-defined objects.
Example:
A={a,e,i,o,u}

Element/s or Member/s
Curly Bracket
Set Name

2 Kinds of Sets
Finite – can count until the last element.
Infinite – can count but not until the last element.
*Countably Infinite – neither finite or infinite.

Set Notation
Roster Method / Listing Method
A={1,2,3,4,5,…}
B={a,e,i,o,u}
C = { hearts , spades , diamonds , clubs }
D = { -1 , 0 , 1 , 2 , 3 , … }
E={0,1,2,3,4,…}
F = { blue , red , yellow }
G = { January , March , May , July , August , October , December }
H = { Monday , Tuesday , Wednesday , Thursday , Friday , Saturday , Sunday }

Set Builder Notation

Rule: Be specific
Always in singular form
“|” or “:” – means “such that”
A = { y|y is a counting number }
B = { x|x is a vowel in the alphabet }
C = { s|s is a shape in a deck of cards }

D = { i|i is an integer from / greater than -1 } D = { i ∈ z | i > -1}

E = { w|w is a whole number }

F = { p|p is a primary color }
G = { m|m is a month with 31 days }
E = { z|z is a day in a week }
Types of Sets:

1. Null Set / Empty Set ; A = { } or A = ∅

2. Singleton Set – only one element
3. Equal Set - same cardinality, same elements ; A = { 1 , 2 , 3 } , B = { 3 , 2 , 1 }
4. Equivalent Set – same cardinality, different elements ; A = { 1 , 2 , 3 } , B = { a , b , c }
5. Subset ; Left is always smaller than the right ; E ⊆ C
6. Proper Subset ; same element different cardinality
7. Superset ; E ⊆ C , therefore C ⊇ E
Ex:
Subset Proper Subset Superset
A ⊆U A ⊂U A⊇U
B ⊆U B ⊂U B⊇U
E ⊆G E ⊄G E ⊇G
F ⊊G F ⊄G F ⊋G

8. Power Set
n = cardinality
A={1,2,3}
2ⁿ = 2³ = 8
P(A) = { { 1 , 2 , 3 } , { 1 , 2 } , { 1 , 3 } , { 2 , 3 } , { 1 } , { 2 } , { 3 } , ∅ }
P(A) means “power set of A”

9. Universal Set
U = Union (operation) | U = Universal (set)
Operation on Sets
1. Union
2. Intersection
3. Disjoint or Joint Set
4. Complement
5. Product
6. Subtraction

Operation on Sets

1. Union – combining of sets, same as addition.

Symbol: U
Ex: A U C = { 1 , 2 , 3 , 4 , 5 , 7 , 9 }
A U U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 } / A U U = U
(matic if combined to universal set)
 2. Intersection – common elements.
Symbol: ∩
Ex: C ∩ E = { 1 , 2 , 3 }
A ∩ F = { } or ∅
3. Joint Set or Disjoint Set
Ex: C ∩ E = Joint Set (If there’s a similarity)
A ∩ F = Disjoint Set (If there’s no similar element)
4. Complement

Ex: Ac = { 2 , 4 , 6 , 8 , 10 }

A U Ac = U

Ec = { 4 , 5 , 6 , 7 , 8 , 9 , 10 }

E U Ec = U

Fc = { } or ∅
5. Product – distribution

* the set on the left will be distributed on the right set.

Ex: E3 x F2 = EF6 → Cardinality of two sets will be multiplied to each other

ExF={{1,x},{1,y},{2,x},{2,y},{3,x},{3,y}}
FxE={{x,1},{x,2},{x,3},{y,1},{y,2},{y,3}}
6. Subtraction
Ex: C – E = { 4, 5 }
E – C = { } or ∅
B – D = { 2, 4 }
D – B = { 7, 9 }
D – F = { 6, 7 , 8 , 9 , 10 }
F–D={x,y}

U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 }

A={1,3,5,7,9}

B = { 2 , 4 , 6 , 8 , 10 }

C={1,2,3,4,5}

D = { 6 , 7 , 8 , 9 , 10 }

E={1,2,3}

F={ x,y}

G={3,1,2}