Scribd
Upload
12 views45 pages

Chapter 5

Uploaded by

carda velunta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views45 pages

Chapter 5

Uploaded by

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

GEC 1

MATHEMATICS IN
THE MODERN WORLD

Prepared by:
Sir Mark Anthony Maiquez, MAEd
CHAPTER 5 LOGIC

PROPOSITIONS AND
CONNECTIVES
What is LOGIC?

 Logic is the science of formal principles of reasoning or


correct inference.

 Historically, logic originated with the ancient Greek


philosopher Aristotle.

 Logic was further developed and systematized by the


Stoics and by the medieval scholastic philosophers.

 In the late 19th and 20th centuries, logic saw explosive


growth, which has continued up to the present.
 Logic is the science of correct reasoning. What then
is reasoning?

 The building blocks of reasoning are propositions.


Proposition

Consider a light bulb. It is either


on or off.

A proposition is a sentence that is either


true or false but not both.

Give examples of propositions. Determine the truth value of


each proposition.

Are all sentences propositions?


Example

1. Today is Monday.
A statement that either true or false

2. My father is an engineer.
A statement that either true or false

3. I am studying at John Paul College.


A statement that either true or false
Propositional Connectives

Suppose now, we have two light bulbs. We have


several possibilities:

One is on, the other is off (How many ways are


there?)

Both are on

Both are off


Propositional Connectives

Depending on the context, each possibility will yield


a status for the the two light bulbs.

Similarly, the truth or falsity of two or more propositions


will depend on the definition of the connective(s) used.
CONJUNCTION

A conjunction is formed by connecting two propositions


by “and”. Either of the propositions involved is called a
conjunct.

Examples of a conjunction.
1. Today is Saturday and it is raining outside.
2. I love dancing and I want to play the music.
3. My father is a policeman and my mother is a politician.
CONJUNCTION

A conjunction is true if both conjuncts are true; otherwise,


it is false.

In a table, display the definition of a conjunction. Use p and q


as representations for the propositions and T and F for true
and false, respectively.
CONJUNCTION

p q p˄q

T T T

T F F

F T F

F F F
DISJUNCTION

A disjunction is formed if two propositions are joined by


“or”. The propositions composing a disjunction are called
disjuncts.

Examples of a disjunction.
1. I can walk to school or I can ride a bicycle to school.
2. I will play the music or I will watch a movie.
3. You can follow my rules or you can leave the classroom.
DISJUNCTION

A disjunction is false if both disjuncts are false; otherwise,


it is true.

In a table, display the definition of a disjunction. Use p and q


as representations for the propositions and T and F for true
and false, respectively.

Determine the truth or falsity of the disjunctions given earlier.


DISJUNCTION

p q p˅q

T T T

T F T

F T T

F F F
NEGATION

The negation of a proposition is the opposite (in truth values)


of the given proposition.

Examples of a negation.
1. Statement: Today is Saturday.
Negative statement: Today is not Saturday.
2. Statement: She doesn’t love chocolate.
Negative statement: She loves chocolate.
3. Statement: I will go to school today.
Negative statement: I will not go to school today.
NEGATION

p ~p

T F

F T
IMPLICATION

𝒑→𝒒
p is called antecedent, q is called consequent.

Examples of an implication.
1. If today is Saturday then tomorrow is Sunday.
2. If you can play the guitar then I can sing it for you.
3. If you are free today then we can watch a movie.
IMPLICATION

Truth table for 𝒑 → 𝒒

p q p→q
T T T
T F F
F T T
F F T
DOUBLE IMPLICATION

p if and only if q is the same as

𝒑 → 𝒒 𝒂𝒏𝒅 𝒒 → 𝒑
𝒑↔𝒒
Examples of an double implication.
1. It is a leap year if and only if there is a Feb. 29 in
the calendar.
2. The figure is a triangle if and only if it has three
sides.
3. It is a right angle if and only if the angle measures
90 degrees.
DOUBLE IMPLICATION

p q p→q q→p p↔q


T T T T T
T F F T F
F T T F F
F F T T T

p q p↔q
T T T
T F F
F T F
F F T
Review

Rewrite the following in symbolic form and give their truth


values in tabular form: (p, q, etc. are representations of
propositions)
1. p and q 𝑝 ∧ 𝑞
2. p or q 𝑝∨𝑞
3. not p ~𝑝
4. If p then q 𝑝 → 𝑞
5. If q then p 𝑞 → 𝑝
6. p if and only if q 𝑝 ↔ 𝑞
Review

A proposition is called a tautology if it is always true no


matter what the truth values of the basic propositions are; it is
a contradiction if it is always false; it is contingent if it is
true for some and false for the other cases.

Decide which of the following is a tautology, contradiction or


contingent:

1. (p → 𝑞) ˄ r
2. ~(p ˄ ~p)
3. ~(p ˅ q) ↔ (~p ˅ ~q)
(𝑝 → 𝑞) ∧ 𝑟
(𝑝 → 𝑞) ∧ 𝑟
p q r p→q (p → q) ˄ r
(𝑝 → 𝑞) ∧ 𝑟
p q r p→q (p → q) ˄ r
T
T
T
T
F
F
F
F
(𝑝 → 𝑞) ∧ 𝑟
p q r p→q (p → q) ˄ r
T T
T T
T F
T F
F T
F T
F F
F F
(𝑝 → 𝑞) ∧ 𝑟
p q r p→q (p → q) ˄ r
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
(𝑝 → 𝑞) ∧ 𝑟
p q r p→q (p → q) ˄ r
T T T T
T T F T
T F T F
T F F F
F T T T
F T F T
F F T T
F F F T
(𝑝 → 𝑞) ∧ 𝑟
p q r p→q (p → q) ˄ r
T T T T T
T T F T F
T F T F F
T F F F F
F T T T T
F T F T F
F F T T T
F F F T F

This proposition is contingent.


~(𝑝 ∧ ~𝑝)
~(𝑝 ∧ ~𝑝)

p ~p p ˄ ~p ~(p ˄ ~p)
~(𝑝 ∧ ~𝑝)

p ~p p ˄ ~p ~(p ˄ ~p)
T
F
~(𝑝 ∧ ~𝑝)

p ~p p ˄ ~p ~(p ˄ ~p)
T F
F T
~(𝑝 ∧ ~𝑝)

p ~p p ˄ ~p ~(p ˄ ~p)
T F F
F T F
~(𝑝 ∧ ~𝑝)

p ~p p ˄ ~p ~(p ˄ ~p)
T F F T
F T F T

This proposition is tautology.


~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T
T
F
F
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T
T F
F T
F F
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T T
T F T
F T T
F F F
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T T F
T F T F
F T T F
F F F T
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T T F F
T F T F F
F T T F T
F F F T T
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T T F F F
T F T F F T
F T T F T F
F F F T T T
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T T F F F F
T F T F F T T
F T T F T F T
F F F T T T T
~(𝑝 ∨ 𝑞) ↔ (~𝑝 ∨~q)
p q p˅q ~(p ˅ q) ~p ~q ~p ˅ ~q ~(p ˅ q) ↔(~p ˅~q)
T T T F F F F T
T F T F F T T F
F T T F T F T F
F F F T T T T T

This proposition is contingent.


END OF CHAPTER 5

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy