FUNCTIONS

 each element in the domain

correspond/paired with exactly one
element in the range.
 Example

Neither One to One nor Onto (Many to One)

Relations
 is a set of ordered pair define by the
Cartesian Product of sets.
 Example:
One to many (Not Function)

Types of Functions
One to One, not Onto

DETERMINE WHICH OF THE FOLLOWING

SET OF ORDERED PAIRS A FUNCTION
OR NOT.
1. A = {(-1,2), (0,1), (1,2),(2,4)}

Onto, not One to One (many to one) ANSWER:

FUNCTION, because each element in
domain corresponds to exactly one element
in range.
2. A = {(3,0), (3,1), (2,3)}
ANSWER:
NOT FUNCTION, because the
element in domain corresponds to more than
One to One, and Onto one element in range.
3. A = {(a,4), (c,5), (d,6), (e,7)}
ANSWER:
FUNCTION, because the element in
domain corresponds to exactly one element
in range.
 Example #2:

 The truth table of a simple statement is  Suppose p q and r are the propositions,
either true (T) or false (F). then a truth table involving the given
propositions has 8 rows.
 The truth value of a compound
statement depends on the truth values
of its simple statements and its
connectives.
 A truth table is a table that shows the n
truth value of a compound statement 2
for all possible truth values of its ¿2
3

simple statements.
¿ 8 rows
 Since a proposition has two possible
truth values. p q r

P
T T T
T (1)
T T F
F (0)
T F T

n
2 =number of rows where n isthe number of propositions . T F F

F T T
Example #1:
F T F
p q
F F T
T (1) T (1)
F F F
T (1) F (0)

F (0) T (1) Types of logical connectors

1. Negation (not)
F (0) F (0)
 The negation of a proposition p is denoted
 For propositions p and q, we have the by p(read as ❑' n o t ' p)
following table
p p

n
2 T F
2
¿2
F T
¿ 4 rows

p1 : 2is an odd number .

 answer : p1 : 2is not an odd number . p q pv q
p1 : The tinikling is themost difficult
T (1) T (1) T
dance .
answer : p1 : The tinikling is not the most T (1) F (0) T

difficult dance . F (0) T (1) T

2. Conjunction (and)
F (0) F (0) F
 The conjunction of a proposition p is
denoted by p˄ q ( read as p∧q )∧is defined

through its truth table . Given:

p q p˄ q Let p and q and r be the following
propositions.
T (1) T (1) T p: June has a date with Liza.

T (1) F (0) F q: Allen is sleeping.

r: Aaron is eating.
F (0) T (1) F
Find;
F (0) F (0) F a. p v q
Solution:

Example: a. June has a date with Liza or Allen is

sleeping.
Given:
Find;
Let p and q be the following
propositions. b. q v ( r )

p: Today is Friday Solution:

q: It is raining a. Allen is sleeping, or Aaron is not

eating.
Find;
Find;
a. p˄ q
c. p v (q v r)
b. p˄( q)
Solution:
Solution:
a. June has a date with Liza, or Allen
a. p˄ q : Today is Friday and it is raining. is sleeping or Aaron is eating.
b. p˄( q): Today is Friday and it is not Find;
raining.
d. Either June has a date with Liza or
Allen is sleeping, or Aaron is eating.
3. Disjunction (or) Solution:
 The disjunction of a proposition p and q is a. P v q v r
denoted by p vq ( read as p∨q )∧is defined

through its truth table .

 4. Conditional conclusion. It is also the process of
reaching a general conclusion by applying
 The conditional of a proposition p and q is general assumptions, procedures or
denoted by p→ q( read as if p ,then q ) principles. Deductive reasoning is the
and is defined through its truth table. process by which a person makes
conclusions based on previously known
p q p→ q facts.

T T T

T F F

F T T

F F T

Suppose that Sachi is a Grade 11,

consider the following conditionals.
p1: If Sachi is in Grade 11, then she is
a senior high school student.
p2: If Sachi is in Grade 11, then she is
working as a lawyer.
p3: If Sachi has a degree in computer
science, then she believes in true love,
SOLUTION:
a. p1 is TRUE; as the first row of the
truth table asserts.
b. p2 is FALSE; as the second row
of the truth table indicates.
c. p3 is TRUE; regardless of the truth
value of its conclusion according to the
last 2 rows of the truth table.

 Inductive reasoning is a type of

reasoning that forms a conclusion based
on the examination of specific examples.
In addition, it is the process of drawing a
general conclusion from a repeated
observations or limited sets of
observations of specific examples. The
conclusion drawn from the observations is
what we call the conjecture.
 Deductive reasoning is a type of
reasoning that uses a general rule,
procedure and principles to reach a