0% found this document useful (0 votes)
249 views10 pages

MMW

The document provides an introduction to logic and Boolean algebra. It defines logic as the study of correct reasoning and discusses how logic allows us to determine the validity of arguments. The document then explains basic logical concepts like simple and compound propositions, logical connectives, truth tables, negation, conjunction, disjunction, and conditionals. Examples are provided to illustrate each concept. Exercises at the end require applying these logical concepts.

Uploaded by

Kim Liat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
249 views10 pages

MMW

The document provides an introduction to logic and Boolean algebra. It defines logic as the study of correct reasoning and discusses how logic allows us to determine the validity of arguments. The document then explains basic logical concepts like simple and compound propositions, logical connectives, truth tables, negation, conjunction, disjunction, and conditionals. Examples are provided to illustrate each concept. Exercises at the end require applying these logical concepts.

Uploaded by

Kim Liat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Mathematics in the

Modern World

First Semester SY 2019 – 2020

MIDTERM PERIOD

Week 1: Logic

At the end of the lesson you will be able to:

1. Identify simple and compound propositions; and

2. Perform the different types of operations on propositions : negation, disjunction, conjunction


and conditional.

LOGIC

Logic is the study of the principles of correct reasoning.

Logic allows us to determine the validity of arguments in and out of mathematics.

Logic illustrates the importance of precision and conciseness of the language of mathematics.

For each statement, determine whether it is TRUE or FALSE.

Example 1

Tuguegarao is a city in Cagayan.

TRUE

Example 2

The Philippines has less than 7,000 islands.

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

The sum of the interior angles of a quadrilateral is 180 degrees.

FALSE

Example 6

Marjorie is beautiful and intelligent.

Neither True nor False

The following are examples of propositions.

1. Tuguegarao is a city in Cagayan.

2. The Philippines has less than 7,000 islands.

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.

5. The sum of the interior angles of a quadrilateral is 180 degrees.

A proposition /statement is a declarative sentence that is either true or false, but not both.
 

Sentences that are NOT propositions/statement

Example 1

Give everyone a perfect score.

Reason

The statement is IMPERATIVE in form.

Example 2

What is the perimeter of a circle whose radius is 3 units?

Reason

The sentence is interrogative in form.

Example 3

Mabuhay USL!

Reason

The statement is Exclamatory in form.

Example 4

X+1=0

Reason

Not a proposition because there is no specific value for x.

Simple and Compound Propositions

 
A SIMPLE proposition conveys a single idea.

A COMPOUND proposition conveys two or more ideas.

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

1. You study hard.

2. Your grades will be better than the last grading period.

Compound Proposition

If you study hard then your grades will be better than the last grading period.

Example 2

Simple propositions

1. Her name is Bea.

2. Her family name is Anderson.

Compound Proposition

Her name is Bea, but her family name is not Anderson.

Example 3

Simple Propositions

1. I like logic.
2. I enjoy solving logic puzzles.

Compound Proposition

I like logic and I enjoy solving logic puzzles.

EXERCISE 2

Consider the following statements.

p: The UAAP basketball game will be played in

Araneta.

q: The UAAP basketball game will be shown on Studio

23.

r : UAAP basketball game will not be shown on GMA.

s: The UP Fighting maroons are favored to win.

Write each of the following symbolic statements in words.

Example 1

q∧p

The game will be shown on Studio 23 and the game will be played in Araneta.

p: The UAAP basketball game will be played in

Araneta.

q: The UAAP basketball game will be shown on Studio

23.

r : UAAP basketball game will not be shown on GMA.

s: The UP Fighting maroons are favored to win.

Example 2
S↔~p

The UP Fighting Maroons are favored to win if and only if the game will not be played in Araneta.

p: The UAAP basketball game will be played in

Araneta.

q: The UAAP basketball game will be shown on Studio

23.

r : UAAP basketball game will not be shown on GMA.

s: The UP Fighting maroons are favored to win.

Example 2

~r∧s

The game will be shown on GMA and the UP Fighting Maroons are favored to win.

SEATWORK 1

Test I

Express each of these compound propositions as an English sentence.

Let p and q be propositions.

p : The election is decided.

q : The votes have been counted.

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

Let p be a proposition. The negation of p is the proposition

“It is not true that p.”

It is denoted by ~p, which is read as “not p”.

Example

The book is interesting.

Negation

It is not true that the book is interesting.

The book is not interesting.

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.

The conjunction p ^ q is TRUE if both p and q are true, otherwise, p ^ q is FALSE.

Example

p: Today is my birthday.

q: I turn 19 years old today.

CONJUNCTION

Today is my birthday and I am turning 19 years old.


 

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.

q: I turn 19 years old today.

DISJUNCTION

Today is my birthday or I turn 19 years old today.

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 you wash the dishes, then I will give you P100.

If I get hired right after graduation, then my family will have a better life.

Exercise 1

Negate each of the following propositions.

1. It is hot.

2. Probinsyano is a famous show in the Philippines.

3. Manananggal does not exist.


4. Tuguegarao is the hottest city in the Philippines.

5. USL is the only CICM school in the region .

Exercise 2

Let p , q and r be the following propositions.

p:Princesa gets a perfect score in the final exam.

q:Princesa answers every exercise in the book.

r: Princesa gets 92% as final grade.

Write the following propositions in terms of p, q and r using logical connectives.

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.

They’re typically denoted as T or 1 for true and F or 0 for false.

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

Compute the truth table of the following:

1. (A V B) ∧ ~ (A ∧ B).

2. (p→q) ∧ (p→ ~ q)

3. {(~ p V q) ∧ (q→ (~ r ∧ ~ p))} ∧ (p V r)

You might also like