GE MATH 4- MIDTERM MODULE

LESSON I: INTRODUCTION TO PROPOSITION

A proposition is a declarative sentence that is either true (T) or false (F), but cannot
be both.

Example 1.1. “Drilling for oil caused dinosaurs to become extinct.” is a proposition.

Example 1.2. “Look out!” is not a proposition.

Example 1.3. “How far is it to the next town?” is not a proposition.

Example 1.4. “x + 2 = 2x” is not a proposition.

Example 1.5. “x + 2 = 2x when x = −2” is a proposition.

Recall a proposition is a declarative sentence that is either true or false. Here are
some further examples of propositions:

Example 1.6. All cows are brown.

Example 1.7. The Earth is further from the sun than Venus.

Example 1.8. There is life on Mars.

Example 1.9. 2 × 2 = 5.

Here are some sentences that are not propositions.

Example 1.10. “Do you want to go to the movies?” Since a question is not a declarative
sentence, it fails to be a proposition.
Example 1.11. “Clean up your room.” Likewise, an imperative is not a declarative
sentence; hence, fails to be a proposition.
Example 1.12. “2x = 2 + x.” This is a declarative sentence, but unless x is assigned a
value or is otherwise prescribed, the sentence neither true nor false, hence, not a
proposition.
Example 1.13. “This sentence is false.” What happens if you assume this statement is
true? false? This example is called a paradox and is not a proposition, because it is
neither true nor false.

TRY!!! Try lang natin, if it doesn’t work, at least we tried.

Instruction: Determine whether the given is a proposition (P) or not (NP)

_______1. Talisay is a city in Cebu. _______6. Go out!

_______2. 2+3 = 6 _______7. This sentence is true.

_______3. She is a Filipina. _______8. The sky is blue.

_______4. Ouch! _______9. 75-10=23

 _______5. 3x+2=5 _______10. Agaray!

_
LESSON II: SIMPLE AND COMPOUND PROPOSITION

FIVE BASIC LOGICAL CONNECTIVES

NAME CONNECTIVE (KEYWORD) SYMBOL

Conjunction and ᴧ

Disjunction or v

Implication or If … then …
Conditional
Biconditional …if and only if…

Negation not ͂ or ⌐

Example:

P – The triangle has three sides.

Q- The triangle has three corners.

~P – The triangle doesn’t have three sides.

~Q – The triangle doesn't have three corners.

P ^ Q – The triangle has three sides and three corners.

P v Q – The triangle has three sides or three corners.

P Q – If the triangle has three sides, then it has three corners.

Q P – If the triangle has three corners, then it has three sides.

P Q – The triangle has three sides if and only if it has three corners.

Instruction: Answer the following using the logical connectives.

P – Today is Monday.

Q – Today is a sunny day.

~P – _______________________________________________________

~Q – _______________________________________________________

P^Q – ______________________________________________________

P v Q – ______________________________________________________
 P Q - _____________________________________________________

P Q - ____________________________________________________

TRUTH TABLE
We can express compound propositions using a truth table that displays the relationships
between the truth values of the simple propositions and the compound proposition. In the next three
tables we show the truth tables for the negation, conjunction, and disjunction. Observe that any
proposition p can take only two values, namely true, denoted T , or false, denoted F . Therefore, for a
compound proposition consisting of two propositions (e.g., p ^ q) we must consider only four possible
assignments of T and F .

It shows the truth or falsity of a compound statement. It depends on the truth or falsity of the simple statements
from which it is constructed.
1.
Conjunction
Let p and q be statements, written p ᴧ q, is the statement formed by joining p and q using the word
“and”. For example, if it is cold and it is raining is understood to be true when both conditions – being
cold and rainy- are satisfied. If it is cold but not raining, or rainy but not cold, or neither cold nor rainy, the
sentence is understood to be false. (Dapat duha ka true para ma true) Truth table for Conjunction
P Q PᴧQ
F F F
F T F
T F F
T T T
2.
Disjunction
P v Q, is the statement written formed by joining the statements P and Q using the word “or” Truth table
for Disjunction. (Dapat naay usa ka true para ma true)
P Q PvQ
F F F
F T T
T F T
T T T

3.
BIIMPLICATION/BICONDITIONAL
P Q , “ P if and only if Q
This statement is called biimplication or biconditional of P and Q. (If pareha kay true, if dili
pareha kay false)
P Q P Q
F F T
F T F
T F F
T T T
4.
IMPLICATION
P Q, “ if p, then q”. This statement is called implication or condition. Where p is the hypothesis ,
and Q is called the conclusion. (If pareha kay true, if di pareha, tan awa ang ikaduha nga proposition)

P Q
P Q Q P
F F T T
F T T F
T F F T
T
T T T

Variations of Conditional Statement

Name Symbolic Form In words
Conditional p→q If p then q
Converse q→p If q then p
Inverse ~p→~q If ~p, then ~q
Contrapositive ~q→~p If ~q then ~p

Example 1: Write the converse, inverse, and contrapositive to the conditional statement
“If I work diligently, then I will gain understanding.”

Let p represent “I work diligently” and q represent “I gain understanding.”

The converse q→p is “If I gain understanding, then I work diligently.”

The inverse p→ q is “If I do not work diligently then I will not gain understanding.”
The contrapositive q→ p is “If I do not gain understanding, then I will not work
diligently."

Example 2: Write the converse, inverse, and contrapositive to the conditional statement
“If I teach third grade, then I am an elementary teacher”.

Let p represent “I teach third grade” and q represent “I am an elementary teacher.”

The converse q→p is “If I am an elementary teacher, then I teach third grade.”
The inverse p→ q is “If I don't teach third grade, then I am not an elementary
teacher.”
The contrapositive q→ p is “If I am not an elementary teacher, then I don't teach
third grade."

Example 3: Write the converse, inverse, and contrapositive to the conditional statement
“If it is raining, then I wear a raincoat”

Let p represent “it is raining” and q represent “I wear a raincoat.”

The converse q→p is “If I wear a raincoat, then it is raining.”

The inverse p→ q is “If it is not raining, then I don’t wear a raincoat.”

The contrapositive q→ p is “If I don’t wear a raincoat, then it is not raining"

NOTE: Be aware that symbolic logic cannot represent the English language perfectly.
For example, we may need to change the verb tense to show that one thing occurred
before another.

LESSON III: TAUTOLOGIES AND VALID FORMS OF ARGUMENTS

A tautology is a statement that is always true, no matter what. If you construct a truth
table for a statement and all of the column values for the statement are true (T), then the
statement is a tautology because it's always true!

It is easy to translate the tautologies from the ordinary language to mathematical

expressions with the help of logical symbols. For example, I will give you 10 pesos or I
will not give you 10 pesos.

Here, let us take:

P = I will give you 10 pesos

~P = I will not give you 10 pesos (Since it is the opposite statement of P)

These two individual statements are connected using the logical operator “OR” which is
generally denoted by the symbol “ ”.

Thus, the above-given statement can be written as P ~P.

Case 1: I will give 10 pesos. In this case, the first statement is true and the second
statement is false. As the given statement is connected using the OR operator, it results
in the true statement.
Case 2: I will not give 10 pesos. In this case, the first statement is false and the second
statement is true. Thus, it produces a true statement.

Now, let us discuss this statement with the help of the truth table.

P (I will give you 10 pesos) ~P ( I will not give you 10 P ~P (I will give you 10
pesos) pesos or I will not give you
10 pesos)

T F T
F T T
Thus, the final column of the truth table is true for all the values, hence the given
statement is a tautology.
TAUTOLOGY LOGIC SYMBOLS
Tautology uses different logical symbols to present compound statements. Here are the
symbols and their meaning used in Maths logic:

TAUTOLOGY TRUTH TABLES

Logical Symbols are used to connect to simple statements, to define a compound
statement and this process is called as logical operations. There are 5 major logical
operations performed on the basis of respective symbols, such as AND, OR, NOT,
Conditional and Bi-conditional. Let us learn one by one all the symbols with their
meaning and operation with the help of truth tables.
Our previous work with statements and truth tables allows us to analyze and to evaluate
arguments using logic. Here, the word argument is not used in the sense that two or
more people disagree with each other. Rather, argument is used in the sense of trying to
make a convincing case that something must be true using ideas of logic.
The everyday notion of an argument is that it is used to convince us to believe
something. An argument is formed with two components: a set of premises and a
conclusion. The thing that we are being encouraged to believe is the conclusion, while
the premises are the statements offered as supporting evidence for the conclusion that
we want to make.
An argument is valid if its conclusion necessarily follows from the premises. Otherwise,
the argument is invalid.

For the conclusion of an argument to necessarily follow from the premises, it means that
the symbolic statement

[ Premise 1 Premise 2 ] → Conclusion

is always true for all possible truth values of the simple statements involved. You might
recall that these types of statements are known as tautologies. If at least one truth
value of this symbolic statement is false, then the argument is invalid. Sometimes, this
type of argument is called a fallacy.
Example 1:

Consider the argument

Premise 1: If you bought bread, then you went to the store.

Premise 2: You bought bread.

Conclusion: You went to the store.

Solution:
While this example is fairly obviously a valid argument, we can analyze it using a truth
table by representing each of the premises symbolically. We can then form a conditional
statement showing that the premises together imply the conclusion. If the truth table is a
tautology (always true), then the argument is valid.
We’ll let b represent “You bought bread” and s represents “you went to the store”. Then
the arguments becomes

Premise 1: b→ s Premise

2: b

Conclusion: s
To test the validity, we look at whether the combination of both premises implies the
conclusion. Is it true that { b→ s)^b}→s
b s b →s { b→s) ^ b} { b→s) ^ b}→s
T T T T T
T F F F T
F T T F T
F F T F T

The last column of the truth table shows that [(b→s)∧b]→s is always true. This is a
tautology, and so the argument is valid. Based on these premises, it is correct to
conclude "You went to the store."

Example 2: p: I go to

summer school q: I will

get an internship

Premise 1: If I do not have to go to summer school, then I will get an internship.

Premise 2: I have to go to summer school.

Conclusion: I won’t get an internship.

Premise 1: ∼p →q

Premise 2: p

Conclusion: ∼q

Form a truth table to find the truth values for [(∼p→q)∧p]→∼q

 p q ∼p ∼q (∼p→q) (∼p→q)^p [(∼p→q)^p]→∼q
T T F F T T F
T F F T T T T
F T T F T F T
F F T T F F T

One truth value for [(∼p→q)∧p]→∼q in the last column of the table is False, while the
remaining truth values are True. This is not a tautology, and so the argument is invalid.
Based on these premises, it is not correct to conclude "I won't get an internship."

Example 3: s=I

studied f= I failed

the class

Premise 1: I studied or I failed the class

Premise 2: I did not fail the class

Conclusion: I studied.

The premises and conclusion can be stated as:

Premise 1: s v f

Premise 2: ∼f

Conclusion: s

Form a truth table to find the truth values for [(s∨f)∧∼f]→s.

s f svf ∼f [(s∨f)∧∼f] [(s∨f)∧∼f]→s.
T T T F F T
T F T T T T
F T T F F T
F F F T F T

All truth values for [(s∨f)∧∼f]→s in the last column of the table are True. This is a
tautology, and so the argument is valid. Based on these premises, it is correct to
conclude "I studied."
SEATWORK 2.1.

Instruction: Write the letter in the space provided.

_____1. Is a systematic study of valid rules, proofs, thinking, or inference. It allows us to
analyze if the statement or proposition is a declarative sentence that either true or false, but
not both.
a. Truth table c. Logic
b. Negation d. Reason
_____2. The connective (keyword) of the symbol v
a. Or c. Not
b. And d. … if and only if …
_____3. The five logical connectives are…
a. Conjunctions, conditionals, compounds, biconditional and disjunctions
b. Conjunctions, statements, disjuncts, biconditional and conditionals
c. Conditionals, disjunctions, negations, biconditional and conjunctions
d. Conditionals, biconditional, negation, disjuncts and conjuncts
_____4. p: The foods in the restaurant is good. What is the negation of the statement?
a. p: The foods in the restaurant is not good.
b. ~p: The foods in the restaurant is good
c. ~p: The foods in the restaurant is not good.
d. p: The foods in the restaurant is good.
______5. The connective (keyword) of the symbol
a. Or c. Not
b. If … then … d. … if and only if …
_______6. The symbolization for a conjunction is …
a. p ᴧ q c. p q
b. p v q d. ~q
_______7. In a disjunction, even if one of the statements is false, the whole disjunction is
still…
a. False c. True
b. Negated d. Both true and false
_______8. Propositional logic uses symbols to stand for statements and …
a. Non-statements c. The relationships between subject and predicate
b. Truth values d. The relationships between statements
_______9. In the conjunction is the one statement is false, the whole conjunction will be …
a. False c. True
b. Negated d. Both true and false
_______10. In the conditional, both of the statements is false, the whole implication will be…
a. False c. True
b. Negated d. Both true and false
SEATWORK 2.2
I. Instruction: Determine whether the given is a preposition or not. Write P if the given is
a proposition and write NP if the given is not a proposition.

_____1. Let’s Go!

_____2. Ice floats on water.

_____3. The sky is blue.

_____4. 1+1=6

_____5. Go out!

_____6. What is your name?

_____7. Flag

_____8. 3 is a multiple of 6

_____9. 5 + 2

_____10. I am happy.

_____11. I studied hard.

_____12. I failed the exam.

_____13. Move!

_____14. Ouch!

_____15. She is good.

II. Write the following statement in symbolic form and vice versa.
p= I am happy q= I am rich
s=I studied r=I passed the exam

a= I love Joshua b=I love Dlar

Statement symbolic
I am happy and I am not rich. 1.

2. svr
3. p→q
If I love Joshua, then I don’t love Dlar. 4.

I didn’t study and I didn’t pass the exam. 5.

6. a^b
7. p↔︎q
I don’t love Joshua and I don’t love Dlar 8.
 9. ∼p →∼q
I studied or I passed the exam.
SEATWORK 2.3.
Instruction: Indicate whether the statement is a simple statement or a compound
statement. If it is a compound statement indicate whether it is a negation, conjunction,
disjunction, conditional or Biconditional by using both the word and the symbol.

1. The sun is shining and the air is crisp.

2. If the electricity goes out then the standard telephone will still work 3. The

hurricane did $400,000 worth of damage to DeSoto County

4. If Cathy Smith walks 4 miles today then she will be sore tomorrow.

5. It is false that if John Wubben fixes your car then you will need to pay him in cash.

Instruction: Write the statement in words

p: The water is 70oF q: The sun is shining

r: We go swimming

1. (p v q)^ ~r

___________________________________________________________________________

2. ~p→ (q v r)
___________________________________________________________________________

3. (q↔︎p)^r
___________________________________________________________________________

4. (p→r)^p
___________________________________________________________________________

5. (p^q)vr
___________________________________________________________________________

Instruction: Write the statement in symbolic form. p: The temperature is 90oF q:

The air conditioner is working. r: The apartment is hot.

______________1. The apartment is hot if and only if the temperature is not 90 oF, or the
air conditioner is not working.
______________2. If the apartment is hot and the air conditioner is working, then the
temperature is 90o F.
______________3. It is false that if the apartment is hot then the air conditioner is not
working.
______________4. The apartment is hot or the air conditioner is not working, if and only
if the temperature is 90o F.
______________5. If the temperature is 90oF then the reconditioner is not working, and
the apartment is hot.

SEATWORK 2.4.

Instruction: Complete the truth table.

P Q ~P ~Q ~P ^ ~Q P v (~P^~Q) P^Q P ~Q ~P Q

T T

T F

F T

F F

Instruction: Find the truth table of the following.

1. The truth value of (E v Q) ~Z

Q=F Z=T E=F

Q E Z EvQ (E v Q) ~Z

2. The truth value of ~ (~p v r) ᴧ ~ (~q ᴧ r)

q=T r=F p=T

q r p ~p ~p v r ~(~p v r) ~q ~q ᴧ r ~(~q ᴧ r) ~(~p v r) ^ ~(~q ᴧ
r)

3. The truth value of (~p ^ ~q) (p v q) p=

T q=F
p q ~p ~q ~p ^ ~q pvq (~p ^ ~q) (p v q)

Instruction: Complete the Table

P Q P ᴧQ PvQ P Q P Q
T T
T T
F T
F F
SEATWORK 2.5.
Instruction: Determine whether the argument is valid and complete its truth table. Write
also the symbolic form of each premise and conclusion.

1. p=I have a shovel q=I

dig a hole

Premise 1: If I have a shovel, I can dig a hole.

Premise 2: I dug a hole.

Conclusion: Therefore, I had a shovel

Symbolic Form

Premise 1: _________

Premise 2: _________

Conclusion: _________

P Q P→Q (P→Q)^D [(P→Q)^D] →S

2. m= I go to the mall

J=I buy jeans

Premise 1: I go to the mall or I’ll buy jeans

Premise 2: I go to the mall

Conclusion: I didn’t buy jeans

Symbolic Form

Premise 1: _________

Premise 2: _________

Conclusion: _________
m j mvj (mvj)^p [(mvj)^p] → j