Performs the Different

Types of Operations
on Propositions
GENERAL MATHEMATICS
PROPOSITION

 A proposition is a declarative
sentence that is either true or false,
but not both. If a proposition is true,
then its truth value is true which is
denoted by T; otherwise its truth
value is false and denoted by F.
LOGICAL OPERATORS
Truth table is used to define
the logical operators. It is used to
exhibit the relationship between
the truth values of its simple
components and the compound
proposition itself.
1. NEGATION
The Negation of a proposition p is denoted by ~p
which is read as “not p”, and is defined through its
truth table.
p ~p

T F

F T
NEGATION: Example

State the negation of the following

propositions
 ~n1 : is not an odd number.

n1 : 2 is an
~n1 : It is not true that 2 is an odd
number.

odd number ~n1 : It is not the case that 2 is an odd

number.

~n1 : 2 is an even number.

n2 : PNHS is
the biggest ~n2 : PNHS is not the biggest high
school in Paoay.
high school
in Paoay.
n3 : The
tinikling is ~n3 : The tinikling is not the most
difficult dance.
the most
difficult
dance.
2. CONJUNCTION

The conjunction p and q is

denoted by:
p ˄ q : (p and q)
and is defined through its truth
table:
CONJUNCTION: TRUTH TABLE
p q p˄q
The propositions p and
T T T
q are called conjuncts.
T F F
F T F It is true only when
F F F both conjuncts are true.
CONJUNCTION: EXAMPLE
Express the ff. conjunctions as English
The conjunction p and sentences or in symbols as the case
q is denoted by: may be.
p ˄ q: (p and q) 1. p ˄ q
Angels exist and they can
fly.
Let p and q be the 2. p ˄ (~q)
following propositions: Angels exist but they
cannot fly.
p: Angels exist. 3. Angels do not exist and
q: Angels can fly. can’t fly.
(~p) ˄ (~q)
4. Angels do not exist but they
can fly.
(~p) ˄ q
NOTE:
Conjunctions do not always use the word “and”. Words like “but, even,
though, yet” and “while” can also be used.

Examples:

1. Carlo is competitive and

hardworking.
2. Carlo is competitive but
hardworking.
3. Carlo is competitive yet
hardworking.
4. Although Carlo is competitive, he is
hardworking.
3. DISJUNCTION
The disjunction of propositions p
and q is denoted by:
p ˅ q : (p or q)
DISJUNCTION: TRUTH TABLE
p q p˅q
The propositions p
T T T
and q are called
T F T disjuncts.
F T T The disjunction p ˅ q
is false only if both
F F F are false.
DISJUNCTION: EXAMPLE
Express the ff. disjunctions as English
The disjunction of sentences or in symbols as the case
propositions p and q may
is denoted by: 1. p ˅be
q.
p ˅ q: (p and q) Vic has a date with Liza or Janree is
sleeping.
2. q ˅ (~r)
Let p and q be the Either Janree is sleeping or Eumir is
following propositions: not
3. peating.
˅ q: (p or q)
p: Vic has a date with Either Vic has a date with Liza, or
Liza. Janree is sleeping or Eumir is
q: Janree is sleeping. eating.
4. (p ˄ q) ˅ (p ˄ r)
R: Eumir is eating.
Either Vic has a date with Liza and Janree is
sleeping or Vic has a date with Liza and Eumir
is eating.
4. CONDITIONAL

The conditional of propositions p

and q is denoted by:
p → q: (if p, then q)
CONDITIONAL: TRUTH TABLE
p → q is being read as p
implies q. p q p→q
T T T
p:
hypothesis
q:
conclusion
T F F
The truth value is FALSE only F T T
when the HYPOTHESIS IS
TRUE and the CONCLUSION F F T
IS FALSE.
CONDITIONAL: EXAMPLE
The conditional CONDITIONAL: SOLUTION
propositions p and q is
denoted by: Consider Mark is in grade 11
p → q: (if p, then q) student.
p1: If Mark is in grade 11, the he is a senior high school
student.
p q p→q T
T T T T
THE SOLUTION IS TRUE
T F F
p2: If Mark is in grade 11, the he is working as a lawyer.
F T T T
F
F F T
THE SOLUTION IS FALSE

p3: If Mark has a degree in Computer Science, then he

believes in true love.
5. BICONDITIONAL
The biconditional propositions p
and q is denoted by:
p ↔ q: ( p if and only if q)
BICONDITIONAL: TRUTH TABLE
It is defined through its p q p↔q
table.
It may also be written T T T
as “p if q”. p and q are
called the components.
T F F

The truth value is TRUE

F T F
when both components F F T
are the same.
BICONDITIONAL: SOLUTION
Consider Mark is a grade 11
student.
p1: Mark is a grade 11 student if and only if he is a senior high
school student.
T
T
p2:
THEMark is a grade
SOLUTION 11 student if and only if he is working
IS TRUE
as a lawyer.
T
F
p3:
THEMark has a degree
SOLUTION in Computer Science if and only if he believes
IS FALSE
in true love.
F
T OR F
THE SOLUTION IS TRUE OR FALSE
LOGICAL OPERATORS
Let p and q be arbitrary propositions

TYPE LOGICAL SYMBOLIC READ AS

OPERATOR FORM
Negation Not ~p Not p

Conjunction And p˄q p and q

Disjunction Or p˅q p or q

Conditional If…then p→q If p, then q

Biconditional If and only if p↔q p if and only if

q