MMW
MMW
Modern World
MIDTERM PERIOD
Week 1: Logic
LOGIC
Logic illustrates the importance of precision and conciseness of the language of mathematics.
Example 1
TRUE
Example 2
FALSE
Example 3
USL is Top 2 Performing School both in the September 2019 Registered Electrical Engineer (REE)
Licensure Examination and Registered Master Electrician (RME) Licensure Examination .
TRUE
Example 4
Lil Nas X’s “Old Town Road”, featuring Billy Ray Cyrus, rules the Billboard Hot 100 for 15 weeks.
TRUE
Example 5
FALSE
Example 6
3. USL is Top 2 Performing School both in the September 2019 Registered Electrical Engineer (REE)
Licensure Examination and Registered Master Electrician (RME) Licensure Examination .
4. Lil Nas X’s “Old Town Road”, featuring Billy Ray Cyrus, rules the Billboard Hot 100 for 15 weeks.
A proposition /statement is a declarative sentence that is either true or false, but not both.
Example 1
Reason
Example 2
Reason
Example 3
Mabuhay USL!
Reason
Example 4
X+1=0
Reason
A SIMPLE proposition conveys a single idea.
Logical Connectives
George Boole used symbols such as p, q, r, and s to represent simple statements and the symbols
and to represent connectives.
EXERCISE 1
Example 1
Simple Propositions
Compound Proposition
If you study hard then your grades will be better than the last grading period.
Example 2
Simple propositions
Compound Proposition
Example 3
Simple Propositions
1. I like logic.
2. I enjoy solving logic puzzles.
Compound Proposition
EXERCISE 2
Araneta.
23.
Example 1
q∧p
The game will be shown on Studio 23 and the game will be played in Araneta.
Araneta.
23.
Example 2
S↔~p
The UP Fighting Maroons are favored to win if and only if the game will not be played in Araneta.
Araneta.
23.
Example 2
~r∧s
The game will be shown on GMA and the UP Fighting Maroons are favored to win.
SEATWORK 1
Test I
1. ~p
2. q ⟶ p
3. p ↔ q
4. p v q
5. ~ q ⟶ ~ p
TRUTH TABLE
The TRUTH TABLE displays the relationship between the possible truth values of the propositions.
NEGATION
Example
Negation
CONJUNCTION
Let p and q be propositions. The conjunction of the propositions p and q is the proposition “p and q”,
which is denoted by p ^ q.
Example
p: Today is my birthday.
CONJUNCTION
DISJUNCTION
Let p and q be propositions. The disjunction of the propositions p and q is the proposition “p or q”,
which is denoted by p v q.
The disjunction p v q is TRUE only when at least one of p and q is true; otherwise p v q is FALSE.
Example
p: Today is my birthday.
DISJUNCTION
CONDITIONAL (Implication)
Let p and q be propositions. The conditional for the propositions p and q is the proposition “if p then q”,
which is FALSE when p is true and q is false, and TRUE otherwise.
It is written as p→q, which can also be read as “ p implies q”, where p is the hypothesis and q is the
conclusion.
Examples
If I get hired right after graduation, then my family will have a better life.
Exercise 1
1. It is hot.
Exercise 2
1. Princesa gets a perfect score in the final exam, but she did not answer the exercises in the book.
2. Princesa gets a perfect score in the finals or she gets 92% as final grade.
3. If Princesa does not get a perfect score in the finals but answered every exercise in the book,
then she still gets 92% as final grade.
HISTORY
Pioneers of Boolean algebra George Boole, John Venn, and Charles Sanders Peirce (Source: MacTutor
History of Mathematics Archive)
What is Boolean Algebra?
Boolean Algebra is a branch of algebra that involves bools (alias of system), or true and false values.
Using this simple system we can boil down complex statements into digestible logical formulas.
Negation
The negation operator is commonly represented by a tilde (~) or ¬ symbol. It negates, or switches,
something’s truth value.
AND
The AND operator (symbolically: ∧) also known as logical conjunction requires both p and q to be True
for the result to be True. All other cases result in False.
OR
The OR operator (symbolically: ∨) requires only one premise to be True for the result to be True.
CONDITIONAL (IMPLICATION)
Logical implication (symbolically: p → q), also known as “if-then”, results True in all cases except the
case T → F.
Example
1. (A V B) ∧ ~ (A ∧ B).
2. (p→q) ∧ (p→ ~ q)