Module 4 - Logic and Reasoning

.
Mathematics in
the Modern
World
2020
Learning Module
STUDENT
Name:
Student Number:
Program:
Year and Section:
Mathematics in the Modern World

Home Address:
Email address:
Contact Number:
PROFESSOR
Name: Prof: Rafael J. Eusebio Jr., LPT
Academic Department: College of Education
rafeusebio14@gmail.com / rafael_eusebio14@yahoo.com
Contact Details: (+639)17 889 4470
1|Page Universidad de Manila

Prepared by: Prof. Rafael J. Eusebio Jr.
Version 2020
i. Course Code GECS004
II. Course Title Mathematics in the Modern World
III. Module Number
IV. Module Title Logic
V. Overview of the In this module, it will discuss the foundation of logic with
Module topics on proposition or statement, compound statement,
truth tables, tautology and logical equivalence.
VI. Module Outcomes As for the outcome of the module, you are expected to:

i. Provide a formal language for mathematical
statements that is easily translatable into the
natural language and that allows compact and
convenient notation;
ii. Understand the different symbols used in math
logic; and
iii. Describe the importance & application of math
logic.
VII. General Instructions You must allow the necessary time to complete the lessons each
week. If you choose not to complete the lesson using the schedule
provided, you must understand that it is your full responsibility
to complete them by the last day of completion. Time is of the
essence.
The module is designed to assess student understanding of the

assigned lessons found within the associated content of the
midterm and final period of the course. The assessment part of
the module is composed of varied types of questions.
You may see gamified assessment tools like crossword puzzles,

scrambled puzzle figures, traditional assessments mechanical
type of tests, and authentic assessments like reflection or simple
research work. Pay attention to the answer to the assessment
questions as you move through each lesson. After each module,

Version 2020
you will be given a summative test. Your responses to the
assessment parts of the module will be checked and recorded.
Because the assessment questions are available within the whole
completion period and because you can refer the answers to the
questions within the content modules, the author-professor will
not release the answers in the module. However, he is happy to
discuss the assessments with you during his consultation time,
should you have any questions.

Good luck.
You may not work collaboratively. This is independent work.
Added instruction with regards to the Progress Tracker
To track your progress in the completion of the module,

each time you completed a task in each part of the
lesson you will earn a badge. Now, to help you not to
skip one of them, you are task to color the badges
earned so that you can easily go back to the activities
you remained idle.
Budget your time wisely and effectively.
Enjoy. Good luck!

Version 2020
Module Progress Tracker
Badge Title Progress Badge Information
Motivated Completed the

Badge Motivational Activity
Independent Have read the entire

Reader Badge Discussion.
Practice Answered the Application

Badge part of the Lesson
Have generalized the

Reflection
discussion through a
Badge
reflection
Quizzer Answered all the questions

Badge in the Assessment part
Lesson
Completed all tasks in the
Completer
entire Lesson.
Badge

Version 2020
Lesson 1 | Statement, Simple and Compound Statement
Logic is the science of thinking and reasoning correctly. Logic has the power to
influence the development of ideas. Reasoning is an important aspect in our daily lives.
It is used in problem solving and critical thinking.
Lesson Objectives At the end of the lesson, you will be able to:

1. Define and recognize, statement, simple statement and compound statement;
2. Differentiate simple and compound statement;
3. Introduce and illustrate the logical connectives used in compound statements;
4. Find the truth value of compound statements using logical connectives;
5. Define converse, inverse, and contrapositive.
Motivation “Crack the Wi-Fi Voucher Code” Activity
Situation: In a computer shop, Wi-Fi connection for 5 hours can freely be accessed if the
customer can crack the code given the following clues.
Clues:
1. In the sequence 0, -5, -10, -15, what is the 3rd term?
2. If a2 = -3, d = 4, what is the 1st term?
3. If a1 = 4, d = -3, what is the 5th term?
4. If a2 = 18, d = -2, write the first 5 terms.
5. Given the first four terms 7, 14, 21, 28,…., what is the 6th term?
6. Given the sequence 6, 10, 14, 18,…, what is the next term?
7. Given the first four terms -14, -7, 0, 7, 14,…,what is d?
8. If d = 7, the first term is 52, what is the 3rd term?
9. Given the sequence 2 + x, 3 + 3x, 4 + 5x,.., what is the next term?
10. Given the sequence x, 6x, 11x, 16x, what is the common difference?
11. Given the sequence 3x + 2, -x + 5, -5x + 8,…, find the next 2 terms.
12. List down the first 5 terms of the arithmetic sequence whose 5 th term is 27 and d
= -3.

Version 2020
Choices
A 20, 18, 16, 14, 12
C -8
D 42
E 39, 36, 33, 30, 27
F -10
G -9x + 11, -13x +14
H 66
I 7

L 22
R -7
S 5X
U 5 + 7X
Wi-Fi Voucher Code:
3 4 2 6 1 2 7 12 5 2 7 3 8 11 4 9 10 10
Congratulations! You earned a Motivated Badge
Discussion Let us Begin!
I. Logic Statements
Sentences can be statements, questions and commands. For instance,

Is it raining? Is a question.
Go to the library? Is a command.
Your bag is nice. Is an opinion.
Manila is the capital of the Philippines. Is a fact statement.

Version 2020
A statement or proposition is a declarative sentence that is either true or false,
but not both true and false.
Example 1: Determine whether each sentence is a statement.

a. When is your birthday?
b. x – 5 = 4
c. Today is rainy day.
d. z - 1
e. 33 +2 is a prime number.

Answer:
a. Not a statement
b. Statement
c. Statement
d. Not a statement
e. Statement
II. Simple Statement and Compound Statements
Statements that express single idea is called a simple statement while statement
that express two or more ideas is called the compound statement.
Compound statement was created by connecting simple statements with words

and phrase and, or, if…then, and if and only if. For example, “I will go to the
concert or I will go to the school” is a compound statement. Composed of two
simple statements: “I will go to concert” and “I will go to the school”. The word or
is a connective for the two simple statements.
Commonly, letters p, q, r, and s are the representation of the simple statements

and the symbols ⋀, ⋁ , ~, →, 𝑎𝑛𝑑 ↔ to represent connectives. Below is the summary:
Statement Connective Symbolic Form Type of Statement

not p not -p Negation
p and q and p^q Conjunction
p or q or pvq Disjunction
If p, then q if…then p→q Conditional
p if and only if q if and only if p↔q Biconditional
The truth value of a simple statement is either true or false.

Version 2020
The truth value of a compound statement depends on the truth values of its simple
statements and its connectives.
Logical Operators
1. Quantifiers and Negation
In a statement, the word some and the phrases there exists and at least one
are called existential quantifiers. Existential quantifiers are used as prefixes
to assert the existence of something.

In a statement, the words none, no, all, and every are called universal
quantifiers. The universal quantifiers none and no deny the existence of
something, whereas the universal quantifiers all and every are used to assert
that every element of a given set satisfies some condition.
The statement not P represented by –p is called the negation of P. It can
be expressed by “it is not the case that” or “it is false that”.
For example, the negation of “I have abandoned you” is “It is not true that
I have abandoned you.” Or “I have not abandoned you.”
The proposition “not p” is true when p is false; “not p” is false when p is true.
The rule for negation is presented on the following truth table:
p -p
T F
F T
Table below illustrates how to write the negation of some quantified

statements:
Statement Negation
All X are Y Some X are not Y
No X are Y Some X are Y
Some X are not Y All X are Y
Some X are Y No X are Y

Version 2020
2. Disjunction
The proposition “p or q” denoted by p v q is called the disjunction of p and

q. The proposition p and q are called disjuncts. P unless q is another
expression of disjunction.
The proposition p v q is true when at least one of the proposition p or q is

true. It is false when both p and q are false. The rule for disjunction is
presented below:

p q pvq
T T T
T F T
F T T
F F F
3. Conjunction
The proposition p and q denoted by p ^ q is called the conjunction of p

and q. The proposition p and the proposition q are called conjuncts.
Moreover, although, still, furthermore, also, nevertheless, however, yet, and
but can be used in place of “and”. A comma or semicolon between two
statements may also stand for and.
The proposition p and q is false when at least of the conjucts p or q is false.

When both p and q are true, then their conjunction is true. The rule for
conjunction is presented below:
p q p^q
T T T
T F F
F T F
F F F
4. Conditional
The proposition p implies q denoted by p → q is called an implication or a

conditional statement. P is called the antecedent, premise or hypothesis,
whereas q is called the conclusion or consequent.
Other ways of expressing p implies q include:

Version 2020
1. If p then q
2. P only if q
3. P is sufficient condition for q
4. Q is necessary condition for p
5. Q if p
6. Q follows from p
7. Q provided p
8. Q whenever p
9. Q is logical consequence of p

The rule for implication is given below:
p q p→q
T T T
T F F
F T T
F F T
5. Biconditional
The proposition p if and ony if q denoted by p ↔ q is called the material

equivalence or biconditional of two propositions p and q. This can be
expressed by p is a necessary and sufficient condition for q, and by p is
materially equivalent to q. The abbreviation iff is used for if and only if. We
note that the biconditional statements puts together the implication of p →
q and q → p in one statement p ↔ q. Thus the material equivalence can
also be written in propositional forms as (p → q) ^ (q → p).
The material equivalence of two propositions is true when these two

propositions are both true and both false. The rule for this logical operator
is shown below.
p q p↔q
T T T
T F F
F T F
F F T
10 | P a g e Universidad de Manila
Version 2020
The Converse, Inverse, and the Contrapositive
Every conditional statement has three related statements. They are called the
converse, the inverse, and the contrapositive.
The converse of p → q is q → p.
The inverse of p → q is -p → -q.
The contrapositive of p → q is -q → -p.
Example 1: Write the converse, inverse, and contrapositive of “If I get job, then I

will buy the NMAX motor”.
Solution:
Converse – If I buy the NMAX motor, then I get the job.
Inverse – If I do not get the job, then I will not buy the NMAX motor.
Contrapositive – If I do not buy the NMAX motor, then I did not get the job.
Example 2: Write the converse, inverse, and contrapositive of “If we have a quiz
today, then we will not have a quiz tomorrow”.
Converse – If we will not have a quiz tomorrow, then we have a quiz today.
Inverse – If we do not have a quiz today, then we will have a quiz tomorrow.
Contrapositive – If we will have a quiz tomorrow, we do not have a quiz today.
Congratulations! You have earned an Independent Reading Badge
Version 2020
Application Fact or Bluff!
Test your understanding. Each number has 2 icons, color the fact icon if the statement is
correct, and the bluff icon if otherwise. (10 points)
1. Statement that express two or more ideas

is called the compound statement

2. The contrapositive of p → q is -q → -p
3. Statement or proposition is a declarative

sentence that is both true and false
4. The truth value of a compound statement

depends on the truth values of its simple
statements and its connectives.
5. Universal quantifiers are used as prefixes

to assert the existence of something.
Congratulations! You have earned a Practice Badge
Version 2020
Generalization Reflect the use of it!
In an essay no more than 100 words, how do you think learning statements, simple and
compound statements are important in your daily lives?

Congratulations! You have earned a Reflection Badge
Assessment: It is your turn!
I. Determine whether each of the following sentences is a statement or

not.
1. x2 – 9 = 0.
2. Is 2 a positive number?
3. Study mathematics in the modern world
4. If stock prices fall, then I will lose money.
5. 121 is a perfect square.
6. President Arroyo is over 5 feet tall.
7. What time is it?
8. z + 3 is a positive integer.
9. The sum of all integers from 1 to n.
10. 11 is an even number.
II. Write the converse, inverse, and contrapositive of the given statement.
Version 2020
1. If a and b are both divisible by 3, then (a + b) is divisible by 3.
2. If they like it, they will return.
3. If x + 4 > 7, then x > 3.
Congratulations! You have earned a Quizzer Badge

List of References:
Icons and Images
https://www.google.com/search?q=fact+fist&tbm=isch&ved=2ahUKEwj5psnQ45TqAhU
nw4sBHVqRCAkQ2-
cCegQIABAA&oq=fact+fist&gs_lcp=CgNpbWcQAzoCCAA6BggAEAoQGDoEC
AAQGDoGCAAQCBAeUJjkBFj6mgVgkpwFaAVwAHgCgAGLA4gBnA-
SAQcyLjYuMS4ymAEAoAEBqgELZ3dzLXdpei1pbWc&sclient=img&ei=d03wXr
mPNaeGr7wP2qKiSA#imgrc=_nh5wNTYRGcWBM
https://www.freepik.com/free-vector/collection-flat-colored-badge_861042.htm
https://www.freepik.com/premium-vector/gold-medal-golden-1st-place-badge-sport-
game-golden-challenge-award-red-ribbon-realistic_6373639.htm
https://www.vectorstock.com/royalty-free-vector/modern-flat-design-badge-icon-
vector-10839496
Congratulations! You have earned Lesson Completer Badge.
Version 2020
Lesson 2 | Translation of Compound Statements in Symbolic Form and
Vice Versa
1. Translate the compound statements in symbolic form; and

2. Translate the symbolic form in compound statements.
Motivation “Pair Me” Activity
Pair each of the following verbal phrase to its variable expression.
Verbal Phrase Variable Expression
1. The sum of a number and 9 a. 48 / n
2. The difference of a number and 21 b. 1/3 n
3. The product of 6 and a number c. n + 9
4. The quotient of 48 and a number d. n – 21
5. One third of a number e. 6n
Version 2020
We will often find it useful to write compound statements in symbolic form.
Example 1:
Consider the following simple statements.

p: Today is Friday
q: It is raining

r: I am going to a movie
s: I am not going to the basketball game.
Write the following compound statements in symbolic form.

a. Today is Friday and it is raining.
b. It is not raining and I’m not going to movie.
c. I am going to the basketball game or I am going to a movie.
d. It is raining, then I am not going to the basketball game.
Solution:
a. p ^ q
b. -q ^ r
c. –s v r
d. q → s
Example 2:
Consider the following statements.

p: The game will be played in Araneta Coliseum.
q: The game will be shown in ABS-CBN.
r: The game will not be shown in GMA.
s: The UDM are favored to win.
Write each of the following symbolic statements in words.

a. q ^ p
b. -r ^ s
c. s ↔ -p
Solution:
Version 2020
a. The game will be shown in ABS-CBN and the game will be played in
Araneta Coliseum.
b. The game will be shown in GMA and the UDM are favored to win.
c. The UDM are favored to win if and only if the game will not be played in
Araneta Coliseum.

1.
2.
3.
4.
Version 2020
5.

In an essay no more than 100 words, how do you think learning translation of
compound statements in symbolic form and vice versa are important in your daily
lives?
Version 2020
I. Write each symbolic statement as an English sentence. Use p, q, r, s,

and t as defined below:
p: Regine Velasquez is a singer.

q: Regine Velasquez is not a songwriter.
r: Regine Velasquez is an actress.
s: Regine Velasquez plays a piano.

t: Regine Velasquez does not play the guitar.
1. (p v r) ʌ q
2. –s → (p ʌ -q)
3. p → (q ʌ -r)
4. (s ʌ -q) → t
5. (r ʌ p) ↔ q
6. t ↔ (-r ʌ -p)
II. Write each sentence in symbolic form. Use p, q, r, and s as defined

below.
p: Rafael Eusebio is a football player.

q: Rafael Eusebio is a volleyball player.
r: Rafael Eusebio is a rock star.
s: Rafael Eusebio play for the UDM.
1. Rafael Eusebio is a football player or a volleyball player, and he

is not a rock star.
2. Rafael Eusebio is a rock star, and he is not a volleyball player or a
football player.
3. If Rafael Eusebio is a volleyball player and a rock star, then he is
not a football player.
4. Rafael Eusebio is a volleyball player, if and only if he is not a
football player and he is not a rock star.
5. If Rafael Eusebio plays for the UDM, then he is a volleyball player
and he is not a football player.
6. It is not true that, Rafael Eusebio is a football player or a rock star.
Version 2020
List of References:

Icons and Images
nw4sBHVqRCAkQ2-
vector-10839496
Version 2020
Lesson 3 | Truth Table
1. Describe the truth values of compound statements for all combinations; and
2. Construct the truth tables of simple and compound statements.

Motivation “Complete Me” Activity
Complete the table below:
p q -p p^q p→q p↔q pvq

T T
T F
F T
F F
The truth table is a table that shows the truth value of a compound statement or
proposition for all possible truth values of its simple statements. The truth value of
a given proposition is always appears in the last column of the truth table.
Proposition with 2 variables, 4 rows are necessary to construct the truth table; for
3 variables, 8 rows are necessary; and in general, for n variables, 2n rows are
required. Below are the examples:
Example 1: Construct the truth table of the proposition (-p v q) v q.
Version 2020
Solution: Since the given proposition has 2 variables p and q, we need 4 rows.
p q -p -p v q (-p v q) v q
T T F T T
T F F F F
F T T T T
F F T T T
Example 2: Construct the truth table of the proposition (p v q) ʌ -r.

Solution: Since the given proposition has 3 variables p, q, and r, we need 8 rows.
p q r -r (p v q) (p v q) ʌ -r
T T T F T F
T T F T T T
T F T F T F
T F F T T T
F T T F T F
F T F T T T
F F T F F F
F F F T F F
Example 3: Construct the truth table of the proposition (p v q) ʌ (r v s).
Solution: Since we have 4 variables, we will use the 2n to determine the number
of rows required.
2n = 24 = 16 rows
p q r s (p v q) (r v s) (p v q) ʌ (r v s)
T T T T T T T
T T T F T T T
T T F T T T T
T T F F T F F
T F T T T T T
T F T F T T T
T F F T T T T
T F F F T F F
F T T T T T T
Version 2020
F T T F T T T
F T F T T T T
F T F F T F F
F F T T F T F
F F T F F T F
F F F T F T F
F F F F F F F

1. Truth table is a table that shows the truth

value of a compound statement or
proposition for all possible truth values of
its simple statements.
2. Proposition with 3 variables, 4 rows are

necessary to construct the truth table.
3. In general, for n variables, n2 rows are

required
4. In statements (-p v q) v q, it has 3

variables.
Version 2020
5. In statements (p v q) ʌ (r v s) has 4
variables.

In an essay no more than 100 words, how do you think constructing truth tables are
important in your daily lives?
Version 2020
Construct a truth table for the given statement.
1. (-p → q)v (-q ʌ p)

2. (p ↔ q) v (q → p)
3. (r ↔ -q) v (p → q)
4. [p ↔ (q → -r)] ʌ -q

List of References:
Icons and Images
nw4sBHVqRCAkQ2-
vector-10839496
Version 2020
Lesson 4 | Tautology, Contradictions, and Contingency

1. Define and distinguish tautology from contradiction and contingency; and

2. Apply tautologies in practical situations.
Motivation “4 PICS 1 WORD” Activity
Propositions are called tautologies if contain only True in the last column of their
truth table, in other words, they are true for any truth values of their variables.
Analogously, a propositions are called contradiction if contain only False in the
last column of their truth table or, in other words, it is false for any truth values of
its variables. Lastly, contingency is a proposition which is neither a tautology nor a
contradiction.
Example 1: Show that the proposition p v –(p ʌ q) is a tautology.
Version 2020
p q p ʌ q -(p ʌ q) p v -(p ʌ q)
T T T F T
T F F T T
F T F T T
F F T T T
Since the truth value of p v –(p ʌ q) is True for all values of p and q, therefore, the
proposition is a tautology.
Example 2: Show that the proposition (p ʌ q) ʌ (-p v q) is a contradiction.

p q p ʌ q (p v q) -(p v q) (p ʌ q) ʌ (-p v q)
T T T T F F
T F F T F F
F T F T F F
F F F F T F
Example 3: Show that the proposition (p → q) ↔ (-q → -p) is a tautology.
p q p → q -q -p -q → -p (p → q) ↔ (-q → -p)
T T T F F T T
T F F T F F T
F T F F T T T
F F F T T T T
Example 4: Show that p → [-p ↔ (p →q)] is a contingency.
p q -p p → q -p ↔ (p →q) p → [-p ↔ (p →q)]

T T F T F F
T F F F T T
F T T T T T
F F T T T T
Version 2020
1. Propositions are called tautologies if

contain only True in the last column of
their truth table.

2. Propositions are called contingency if
contain only False in the last column of
their truth table.
3. Contradiction is a proposition which is

neither a tautology nor a contingency.
4. (p → q) is a contingency.
5. (p ʌ q) is a tautology
Version 2020
In an essay no more than 100 words, how do you think learning tautologies,
contradiction and contingency are important in your daily lives?

I. Use a truth table to determine whether the given statement is a

tautology, contradiction, or a contingency.
1. p ʌ (q ʌ -p)
2. (p ʌ q) v (p → -q)
3. [-(p → q)] ↔ (p ʌ -q)
Version 2020
List of References:
Icons and Images
nw4sBHVqRCAkQ2-

vector-10839496
Version 2020
Lesson 5 | Logically Equivalence
1. Define logically equivalence; and

2. Determine if given statements are logically equivalent or not.

Motivation “Name It” Activity
Guess the word:
1. +G+ = _________________
-CIUM
2. + + = _________________
-lateral - se
Version 2020
Two statements are equivalent if they both have the same truth value for all
possible truth values of their simple statements. Equivalent statements have
identical truth values in the final columns of their truth tables. The notation p ≡ q
is used to indicate that the statements p and q are equivalent.
Example 1: Show that –(p v –q) and –p ʌ q are equivalent statements.

Solution:
p q -q p v –q –(p v –q)
T T F T F
T F T T F
F T F F T
F F T T F
p q -p –p ʌ q
T T F F
T F F F
F T T T
F F T F
Since their truth values are equivalent, thus, –(p v –q) and –p ʌ q are equivalent
statements.
Example 2: Show that –(-p v –q) and p ʌ q are equivalent statements.
Solution:
p q -p -q -p v –q –(p v –q)
T T F F F T
T F F T T F
F T T F T F
F F T T T F
p q pʌq
T T T
T F F
F T F
Version 2020
F F F
Since their truth values are equivalent, thus, –(-p v –q) and p ʌ q are equivalent
statements.

1. Two statements are equivalent if they both

have the same truth value for all possible truth
values of their simple statements.
2. (p v –q) and –p ʌ q are logically equivalent.
3. -p → -q ; p v –q are not logically equivalent
4. -p → -q ; p v –q are logically equivalent
Version 2020
5. p ↔ q ; (p ʌ q) v (-p ʌ -q) are logically
equivalent

In an essay no more than 100 words, how do you think learning logically equivalence
are important in your daily lives?
Version 2020
I. Use a truth table to show that the given pairs of statements are
logically equivalent.
1. -p → -q ; p v –q
2. p ↔ q ; (p ʌ q) v (-p ʌ -q)

List of References:
Icons and Images
nw4sBHVqRCAkQ2-
vector-10839496
Version 2020
Version 2020

Module 4 - Logic and Reasoning

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module 4 - Logic and Reasoning

Uploaded by

Copyright:

Available Formats

.

Mathematics in the Modern World

1|Page Universidad de Manila

Mathematics in the Modern World

The module is designed to assess student understanding of the

You may see gamified assessment tools like crossword puzzles,

2|Page Universidad de Manila

Mathematics in the Modern World

You may not work collaboratively. This is independent work.

Added instruction with regards to the Progress Tracker

To track your progress in the completion of the module,

Budget your time wisely and effectively.

Enjoy. Good luck!

3|Page Universidad de Manila

Motivated Completed the

Independent Have read the entire

Mathematics in the Modern World

Practice Answered the Application

Have generalized the

Quizzer Answered all the questions

4|Page Universidad de Manila

Mathematics in the Modern World

Motivation “Crack the Wi-Fi Voucher Code” Activity

5|Page Universidad de Manila

Mathematics in the Modern World

Wi-Fi Voucher Code:

Congratulations! You earned a Motivated Badge

Discussion Let us Begin!

Sentences can be statements, questions and commands. For instance,

6|Page Universidad de Manila

Example 1: Determine whether each sentence is a statement.

Mathematics in the Modern World

II. Simple Statement and Compound Statements

Compound statement was created by connecting simple statements with words

Commonly, letters p, q, r, and s are the representation of the simple statements

Statement Connective Symbolic Form Type of Statement

The truth value of a simple statement is either true or false.

7|Page Universidad de Manila

1. Quantifiers and Negation

Mathematics in the Modern World

Table below illustrates how to write the negation of some quantified

8|Page Universidad de Manila

The proposition “p or q” denoted by p v q is called the disjunction of p and

The proposition p v q is true when at least one of the proposition p or q is

Mathematics in the Modern World

The proposition p and q denoted by p ^ q is called the conjunction of p

The proposition p and q is false when at least of the conjucts p or q is false.

The proposition p implies q denoted by p → q is called an implication or a

9|Page Universidad de Manila

Mathematics in the Modern World

The proposition p if and ony if q denoted by p ↔ q is called the material

The material equivalence of two propositions is true when these two

Mathematics in the Modern World

Congratulations! You have earned an Independent Reading Badge

1. Statement that express two or more ideas

Mathematics in the Modern World

3. Statement or proposition is a declarative

4. The truth value of a compound statement

5. Universal quantifiers are used as prefixes

Congratulations! You have earned a Practice Badge

Mathematics in the Modern World

Assessment: It is your turn!

I. Determine whether each of the following sentences is a statement or