MA.

Ed

LOGIC and SET

THEORY

MATH 103
 LOGIC

reasoning conducted
or assessed according Tool for working
to strict principles of complicated compound
validity. statements.

Science of reasoning, Allows us to determine

proof, thinking, or the validity of arguments
inference. in and out mathematics.
 WHAT IS PROPOSITION/STATEMENT?

Earth is the third planet

TRUE
PROPOSITIONA from the Sun.
L VARIABLES
Cebu is the capital of FALSE
PROPOSITION Philippines.
Such as p, q, r, s, t,
- Declarative sentence etc. are used to
that is true or false but represent
not both. propositions. x>5 if x = 3 FALSE

TRUTH
VALUE:
true/false
 PROPOSITION? YES or NO?

Please give me some water. IMPERATIVE

Where are you going? INTEROGATIVE

NOT
PROPOSITION
x + 5 = 3. Neither TRUE nor FALSE

Please. Help me now! EXCLAMATORY

 SIMPLE and COMPOUND PROPOSITION

SIMPLE
COMPOUND
PROPOSITIONS
PROPOSITION
- A proposition that
conveys one thought - Contains of two or more
simple propositions that
and no connecting
are put together using
words.
connective words e.g. if,
then, or, and etc..
 Let p and q be
propositions. LOGICAL CONNECTIVES
DISJUNCTION IMPLICATION BICONDITIONAL
(v) = “or” () = “then” () = “if and only if”
CONJUNCTION - “p or q” denoted as p ^ q which - “if p then q” denoted as pq - “p if and only if q” denoted as
is false only when both p and q which is false only when p is true pq which is true only when both p
(^) = “and” and q is false. and q have the same truth values
- “p and q” denoted as p ^ q are false, otherwise, it is true.
which is true only when both p TRUTH VALUE
and q are true, otherwise, it is TRUTH VALUE
TRUTH VALUE p q pq
false. p q
p q pvq pq
TRUTH VALUE T T T
T T T T T T
p q p^ T F F
q T F T T F F
F T T
T T T F T T F T F
F F T
T F F F F F F F T
F T F
NEGATION TRUTH VALUE
F F F
(¬) = “not” p ¬p q ¬q
- The truth value of the negation is T F T F
always the reverse of the truth
value of the original statement. F T F T
 DEDUCTIVE ARGUMENT- the truth of the conclusion is a logical consequence of
the premises-if the premise are true, then the conclusion must be true.

PREMISES INFERENCE CONCLUSION

The claims that are given in The premise that is the

support of an argument. A consequence, or product, of the
The logical move from one or
premise is a propositional above premises plus inference.
more premises to arrive at its
A = {x∈U⎥x
statement which isiseither
a natural
true A conclusion can then itself
conclusions.
number less than 4}
or false. become a premise (building
block) of a continued or new
argument
Conditional/implication statements play an essential role in mathematical
reasoning. It can be transformed into new conditional statements. In
particular, there are three related conditional statements: converse, inverse
and contrapositive.
 REMEMBER:
Conditional/implication statements play an essential role in mathematical CONDITIONAL: p  q
reasoning. It can be transformed into new conditional statements. In CONVERSE: qp
particular, there are three related conditional statements: converse, inverse INVERSE: ¬p  ¬q
and contrapositive. CONTRAPOSITIVE: ¬q  ¬p

Suppose we have the following statements for p and q.

Note: p: It rains
q: They can cancel school
IMPLICATION/CONDITIONAL STATEMENT is
Logically equivalent to CONTRAPOSITIVE Conditional/Implication:
STATEMENT, in symbol: p  q  ¬q  ¬p If it rains then they can cancel school.
Converse:
CONVERSE STATEMENT is Logically equivalent to If they cancel school then it rains.
INVERSE STATEMENT, in symbol: q  p  ¬p  Inverse:
¬q If it does not rain then they do not cancel school.

Contrapositive:
If it they do not cancel school, then it does not rain
 Writing an Argument in Symbolic Form
Write an Arguments in Symbolic Form and Valid Arguments
Given Propositions: p q ¬p ¬q (p¬q) ((p¬q)^¬p) ((p¬q)^¬p)q
I have a college degree (p)
I am lazy (q)
T T F F F F T
Arguments:
If I have a college degree, then I am not lazy. T F F T T F T
I don’t have a college degree.
Therefore, I am lazy. F T T F T T T

F F T T T T F
Symbolic form:
If I have a college degree, then I am not lazy (p¬q)
I don’t have a college degree (¬p)
Therefore, I am lazy (q) Argument is INVALID

Hypothesis: ((p¬q)^¬p)
Conclusion: q
 SETS

Well-defined collection of distinct objects.

Well-defined if the elements in a set are specifically listed or if

its elements described to determine whether an object in
question is an element or not in set.
SETS
Finite set if the number of elements in the set is a whole
number. Contains a countable number of elements.

Infinite if the counting of elements has no end.

 SETS
JOINT SETS
EMPTY or NULL -Sets that have common elements.
SET - Ex: A={4,5,6}; B={6,7,8}:common (6)
-is the contains no elements  or { }

DISJOINT SET
EQUAL SET -Sets have no common elements.
-A=B, if and only if A and B have -Ex: A={a,b,c};B={e,f,g}
exactly the same elements.
- Ex: A = { h, o, p, e}; B = {p,o,e,h}
SUBSET
-A B, if every element of A belongs to
EQUIVALENT SET B.
- Ex: A = {1,2,3}; B = {1,2, 3, 4,5)
-A~ B, if and only if A and B have
the same number of elements.
- Ex: A = {l,o,v,e}; B = {a,b,c,d} UNIVERSAL SET
-Sets of all elements that are being considered.
-Ex: A={a,b,c d};B={e,f,g}:U= {a,b,c,d,e,f,g}
 ILLUSTRATION OF SETS

SET BUILDER
VENN DIAGRAM ROSTER
NOTATION
U

A A = {x∈U⎥x is a natural
1 A = {1, 2, 3} number less than 4}
3
2
 BASIC OPERATIONS ON SETS
A∪B = sets of all elements found in A or B or UNION Ex: A = {a,b,c,d} ∪ B={b,e,f,g} = {a,b,c,d,e,f,g}
both = {x⎥x∈A or x∈B} SETS

A∩B = set of all elements common to Ex: A = {1,2,3,4} ∩ B={0,2,3,4,9} = {2,3,4}

both A and B
INTERSECTION
= {x⎥x∈A and x ∈B}

A’ = set of elements found in the universal

set but not in A = {x⎥x∈U and x not ∈} COMPLEMENT OF A Ex: A = {1,2}, U={1,2,3,4,5} A’= {3,4,5}

A/B is referred to as the set difference of DIFFERENCE OF SET

sets A and B , or the relative complement Ex: A = {4,5,6,7}, B={1,6,7,8,9}
A and B A/B = {4,5}
of B in A.
A/B= the set of elements in A but not in B/A = {1,8,9}
B.
A/B ={x⎥x∈A and x∉B}; similarly, B/A
= {x⎢x∈B and x ∉A}