Logic

General Mathematics – Lesson 4

Declarative, Imperative, Interrogative,
Exclamatory?
1. Are you one of my students in Mathematics class?
2. You can do it, Marites!
3. If you don’t live here, then please don’t park here.
4. Manila is one of the populated areas in the Philippines.
5. Keep your eyes open.
Fact or Bluff?
1. You are taller in the morning than in the
evening.
2. By the age of 18, your brain stops growing.
3. Sourness is taste in the tip of the tongue.
4. There are more Chinese than American.
5. Melatonin gives color to our skin.
Proposition is a declarative statement which is either
true or false.
A proposition is denoted by a small letter.
Proposition either affirms or denies something about a
certain reality or object but not both.
Simple proposition is a proposition that conveys one
thought with no connecting words.
Compound Proposition contains two or more simple
propositions that are put together.
Examples of Proposition:
p: Manila is the capital of the Philippines.
q: 12+8=21
r: Mark Zuckerberg is the chief executive of
Facebook.
Let’s study the following statements:
1. Are you a Senior High School student?
2. Go, Pheljoy!
3. Do not talk when your mouth is full.
4. Keep quiet.
5. I am lying.
Determine if PROPOSITION or NOT:
1.All arguments are valid.
2.Go to your room.
3. What are you eating?
4. The average of 5 and 7 is 12.
5. Liz, can you lend me ₽100?
6. Quadrilaterals have four equal sides.
Simple proposition is a proposition that conveys one
thought with no connecting words.
Compound Proposition contains two or more simple
propositions that are put together.
Let’s study the following statements:
a: Grounding is beneficial to a person.
d: There is no stronger than the heart of a volunteer.
p: 3! = 6/2
𝑝1: If an individual is great, then there is a teacher behind.
𝑝2: Either a person saves before spending, or one spends
before saving.
Let’s study the following statements:
𝑝3: It is not a shame to greet the utility worker the same
way as with the school principal.
𝑝4: If a person is disabled, then he/ she is entitled to obtain
a PWD ID, and if a person is entitled to obtain a PWD ID,
then he/ she is disabled.
The five types of compound propositions are:
1. Conjunction Let p be a proposition and q be another proposition. The
operation “and” is denoted by the symbol “∧” for conjunction. Hence
“p and q” can be symbolized by “p ∧ q”.
2. Disjunction Let p be a proposition and q be another proposition. The
operation “or” is denoted by the symbol “∨” for conjunction. Hence
“p or q” can be symbolized by “p ∨ q”.
3. Conditional / Implication Logical implication, symbolized by “→” is
another relation between two propositions. It makes use of the “If-
then” statement. Let p be a proposition and q be another proposition.
Then, the implication “p implies q” is denoted by “p → q”.
The five types of compound propositions are:
4. Biconditional - It is possible for p → q and q → p to be both true. If
this is so, we use the symbol “↔” To mean “p if and only if q” When
this condition is true, we say that p and q are logically equivalent.

5. Negation Let p be a proposition. The “negation” of p is written as ~p.

The five types of compound propositions are:
oConjunction Two simple propositions connected using the word and.
oDisjunction Two simple propositions connected using the word or.
oConditional Two simple propositions connected using the word if-then.
oBiconditional Two simple propositions connected using the word if
and only if.
oNegation It can be obtained by inserting the word not in the given
statement or by prefixing it with phrases such as “It is not the case that”
Translating Propositional Logic into Statements

Let a: Jose loves Maria.

b: The car is on the street.
c: Laureen is catching chicken.

Translate: into a statement.

The symbol used is for conjunction, so we will use ‘and’ to connect
two simple propositions,

Answer: Jose loves Maria and the car is on the street.

Translating Propositional Logic into Statements

Let a: Jose loves Maria.

b: The car is on the street.
c: Laureen is catching chicken.

Translate: into a statement.

The symbol used is for disjunction, so we will use ‘or’ to connect
two simple propositions, .

Answer: Jose loves Maria or the car is on the street.

Translating Propositional Logic into Statements

Let a: Jose loves Maria.

b: The car is on the street.
c: Laureen is catching chicken.
 
Translate: into a statement.
The symbol used is for conditional, so we will use ‘if-then’ to
connect two simple propositions, .

Answer: If Jose loves Maria then Laureen is catching chicken.

Translating Propositional Logic into Statements

Let a: Jose loves Maria.

b: The car is on the street.
c: Laureen is catching chicken.

Translate: into a statement.

The symbol used is for biconditional, so we will use ‘if and only if’
to connect two simple propositions, .

Answer: The car is on the street if and only if Laureen is catching

chicken.
Translating Propositional Logic into Statements

Let a: Jose loves Maria.

b: The car is on the street.
c: Laureen is catching chicken.

Translate: ~ c into a statement.

The symbol used is for negation, so we will negate proposition .

Answer: Laureen is not catching chicken,

It is not the case that Lauren is catching chicken.
Translating Statements to Propositional Logic

Let m: Cecile lives in the Philippines

n: Cecile likes avocado.

Translate “Cecile likes avocado and she lives in the Philippines.”

Answer: n ∧ m

Translate “Cecile does not like avocado.”

Answer: ~n
Translating Statements to Propositional Logic

Let m: Cecile lives in the Philippines

n: Cecile likes avocado.

Translate “Cecile lives in the Philippines if and only if she likes

avocado.”
Answer: m ↔ n

Translate “If Cecile likes avocado then, she lives in the Philippines.”
Answer: n → m
Translating Statements to Propositional Logic

Let m: Cecile lives in the Philippines

n: Cecile likes avocado.

Translate “Cecile lives in the Philippines or she likes avocado.”

Answer: m ∨ n
A truth table shows the relationship between the truth
values of the statements. This is a vital tool in determining
truth values of statements formed from simple statements.
Constructing Truth Tables
1. Determine if the final result is a conjunction, disjunction, conditional,
biconditional, or negation.
2. Complete the columns under;
a) the simple statements
b) the connective negations inside parentheses
c) any remaining statements and their negations
d) any remaining connectivesreaching the final column as determined
in Step 1.
3. Each truth table of compound proposition of n component statements,
represented by different letters, has 2^n number of rows.
Conjunctions
The connective implies the idea of
“both”. For the conjunction p ∧ q
P q p q
to be true, both p and q must be
T T T
true.
T F F
F T F
F F F
Example
Let p: 2 + 1 = 5 and q: One foot
is equivalent to 12 inches.
P q p q
T T T
Since p is false and q is true, the
T F F
conjunction p ∧ q: 2 + 1 = 5 and F T F
one foot is equivalent to 12 inches F F F
is false. In symbols,
Example
Let p: Square is a closed-sided
figure and q: Rectangle has four
P q p q
right angles.
T T T
Since p is true and q is true, the T F F
conjunction p ∧ q: Square is a F T F
closed-sided figure and rectangle F F F
has four right angles is also true. In
symbols,
Disjunctions
If p and q are propositions, then the
disjunction of p and q is “p or q”.
There are two types of disjunction, P q p∨q
the inclusive disjunction and the T T T
exclusive disjunction. T F T
F T T
F F F
Inclusive Disjunction is true unless
each statement is false.
Inclusive Disjunction is true unless each statement is false.

Example
If Lyn says that she is eating or watching. This
statement allows that Lyn is eating and not watching to be
true. Lyn is not eating and watching to be true, and Lyn is
eating and watching to be true.
Exclusive Disjunction is true when P q p∨q
one component is true and the other T T F
is false. p or q (p∨q) T F T
F T T
F F F
Example:
Lorenze is in the library or is the canteen, this
statement will only be true when exactly one of the two
propositions is true. Otherwise, it will be false.
Conditional
If p and q are simple propositions,
then the statement “If p then q” or “p
P q p→q
implies q”, denoted by p → q, is
T T T
called a conditional statement or
T F F
implication. A conditional statement F T T
is false when p is true and q is false F F T
otherwise, it is true.
Biconditional
Let p and q are simple propositions. The
P q p↔q
statement form (p → q) ∨ (q → p), is T T T
called the biconditional of p and q. This T F F
is read as “p if and only if q” and is F T F
denoted by p ↔ q. A biconditional F F T
statement is true if both p and q have the
same truth values and false if p and q
have opposite truth values.
Negation
If p is a simple proposition, then
the negation of p is “not p” or “it is p p
not the case that p” and is denoted T F
by ~p. The truth value of the F T
negation of p is opposite the truth
value of p.
Conjunctions Inclusive Disjunction Exclusive Disjunction
P q p q P q p∨q P q p∨q
T T T T T T T T F
T F F T F T T F T
F T F F T T F T T
F F F F F F F F F
Conditional Biconditional Negation
P q p→q P q p↔q
T T T T T T p p
T F F T F F T F
F T T F T F F T