0% found this document useful (0 votes)
92 views27 pages

Grade 11

This document provides an introduction to logic and propositions. It defines logic as the science of reasoning and propositions as statements that can be either true or false. Propositions are classified as either simple or compound. Logical operators such as negation, conjunction, disjunction, and implication are introduced and examples are provided to illustrate how they combine propositions. Truth tables are presented as a way to determine the truth values of compound propositions.

Uploaded by

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

Grade 11

This document provides an introduction to logic and propositions. It defines logic as the science of reasoning and propositions as statements that can be either true or false. Propositions are classified as either simple or compound. Logical operators such as negation, conjunction, disjunction, and implication are introduced and examples are provided to illustrate how they combine propositions. Truth tables are presented as a way to determine the truth values of compound propositions.

Uploaded by

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

GOOD DAY!

FRANCISCANS!
WELCOME TO MR. ARAGON’S
VIRTUAL CLASSROOM

ACADEMICS.
AND BEYOND

1
ATTENDANCE

ACADEMICS.
AND BEYOND

2
LET’S PRAY
LOGIC
Nature of Proposition
WARM UP!
You may enter, but you may not
come in,
I have space, but no room,
I have keys, but open no lock.

What am I?
LOGIC
It is a science of formal principles of reasoning or
correct inference. It is a study of the principles
and methods used to distinguish valid arguments
from those that are not valid.
PROPOSITIONS
It is a declarative sentence that is either true or false,
but not both. If the proposition is TRUE, then its
truth value is truth which is denoted by T, otherwise,
its truth value is FALSE and is denoted by F. We use
letters such as p, q, r, s, etc. to symbolize
propositions.
EXAMPLES:
Determine whether each of the following statements is a proposition or not. if
proposition, give its truth value.

p: Mindanao is an island in the Philippines. P


q: Find a number which divides your age. not P
r: My seatmate will get a perfect score in the logic exam. P
s: Welcome to the Philippines! not P
EXAMPLES:
Determine whether each of the following statements is a proposition or not. if
proposition, give its truth value.

t: 3+2 = 5 P
u: f(x) is a rational function.
P
 

v: What is the domain of the function f(x) = 2x+5? not P


w: I am lying. not P
p 5 : 2x - 4y = 7 not P
Two Types of
Proposition
SIMPLE PROPOSITION
It is a proposition that cannot be broken down
into other component propositions. It is written
in a single variable.
EXAMPLES:
The following are examples of simple propositions:
p: Mindanao is an island in the Philippines.

r: My seatmate will get a perfect score in the logic exam.


t: 3+2 = 5
u: f(x) is a rational function.
 

p 1 : 5+1 = 10
COMPOUND PROPOSITION
It is the result of combining simple
propositions or combining new propositions
from existing propositions.

Logical Connectors are used to form new


propositions p and/or q: not p, p and q, p or q,
and if p then q.
EXAMPLES:
The following are examples of compound propositions:

p 2 : Either logic is fun and interesting or it is boring.

p3: If you are a grade 11 student, then you are a Filipino.

p 4 : If you are 60 years old, then you are entitled to a senior citizen
card, and if you are entitled to a senior citizen card, then you are more
than 60 years old.
EXAMPLES:
The following are examples of compound propositions:
p 2 : Either logic is fun and interesting or it is boring.

f : Logic is fun.
g : Logic is interesting.

b : Logic is boring.

p2: f and g or b.
EXAMPLES:
Write the following into simplest form:
p : i t ’s h o t q : i t ’s w e t r : I ’ m t i re d

I’m tired or it’s hot. r or p


It’s wet or it’s not hot. q or not p.

It’s hot or wet or I’m not tired. p or q or not r.


It’s hot and wet or it’s hot and not wet. p & q or p and not q.
If I’m tired then it’s hot. If r then p.
LOGIC
operations on
propositions
TRUTH TABLE
It shows all the possible truth values of the given propositions.
p q r
p q T T T
p T T
T
T
T
F
F
T
T T F T F F
F T T
F F T F T F
F F F F T
F F F
NEGATION
The negation of a proposition p is denoted by
′ ′
 
𝑝 :(𝑟𝑒𝑎𝑑 𝑎 𝑠 𝑛𝑜 𝑡 𝑝)
and defined through its truth value:

𝑝
 
p
T F
F T
E XAM PLE S :
 
𝑺𝒕𝒂𝒕𝒆 𝒕𝒉𝒆 𝒏𝒆𝒈𝒂𝒕𝒊𝒐𝒏 𝒐𝒇 𝒕𝒉𝒆 𝒇𝒐𝒍𝒍𝒐𝒘𝒊𝒏𝒈 𝒑𝒓𝒐𝒑𝒐𝒔𝒊𝒕𝒊𝒐𝒏𝒔
: 𝐺𝑙𝑒𝑛∧ 𝑁𝑖 ñ 𝑜 𝑎𝑟𝑒 𝑏𝑟𝑜𝑡h𝑒𝑟𝑠 .
𝑠 : 𝐺𝑙𝑒𝑛∧ 𝑁𝑖 ñ 𝑜 𝑎𝑟𝑒 𝑛𝑜𝑡 𝑏𝑟𝑜𝑡h𝑒𝑟𝑠 .
𝑤 : 𝑇h𝑒 𝑠𝑢𝑚 𝑜𝑓 12 𝑎𝑛𝑑 13𝑖𝑠 25.
𝑤 : 𝑇h𝑒 𝑠𝑢𝑚 𝑜𝑓 12 𝑎𝑛𝑑 13 𝑖𝑠 𝑛𝑜𝑡 25.
 
u : 2 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟 .
 
u : 2𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟 .
CONJUNCTION
The conjunction of a propositions p and q is denoted by
 
𝑝 ∧𝑞 : (𝑟𝑒𝑎𝑑 𝑎𝑠 ′ 𝑝 𝑎𝑛𝑑 𝑞 ′ )
𝑝 ∧𝑞
 

p q
and defined T T T
through its T F F
truth value: F T F
F F F
E XAM PLE S :
 
𝑬𝒙𝒑𝒓𝒆𝒔𝒔 𝒕𝒉𝒆 𝒇𝒐𝒍𝒍𝒐𝒘𝒊𝒏𝒈 𝒔𝒆𝒏𝒕𝒆𝒏𝒄𝒆𝒔 𝒊𝒏 𝒔𝒚𝒎𝒃𝒐𝒍𝒔
 
𝑟 : 𝑀𝑎𝑡h 𝑖𝑠 𝑓𝑢𝑛 .
 
𝑠 : 𝑀 𝑦 𝑀𝑎𝑡h 𝑡𝑒𝑎𝑐h𝑒𝑟 𝑖𝑠 h𝑎𝑝𝑝𝑦 .
 
𝑟 ∧ 𝑠  𝑀𝑎𝑡h𝑖𝑠
: 𝑓𝑢𝑛 𝑎𝑛𝑑 𝑚𝑦 𝑚𝑎𝑡h 𝑡𝑒𝑎𝑐h𝑒𝑟 𝑖𝑠 h𝑎𝑝𝑝𝑦 .
𝑟 ∧( 𝑀𝑎𝑡h𝑖𝑠 𝑠) : 𝑓𝑢𝑛 𝑎𝑛𝑑 𝑚𝑦 𝑚𝑎𝑡h 𝑡𝑒𝑎𝑐h𝑒𝑟 𝑖𝑠 𝑠𝑎𝑑 .
 
 
 
𝑀𝑎𝑡h𝑖𝑠 𝑓𝑢𝑛 𝑎𝑛𝑑 𝑚𝑦 𝑚𝑎𝑡h 𝑡𝑒𝑎𝑐h𝑒𝑟 𝑖𝑠 𝑛𝑜𝑡 h𝑎𝑝𝑝𝑦 .
 
( 𝑟 )∧ 𝑀𝑎𝑡h𝑖𝑠
( 𝑠) 𝑛𝑜𝑡: 𝑀𝑎𝑡h𝑖𝑠
𝑓𝑢𝑛 𝑎𝑛𝑑 𝑚𝑦 𝑚𝑎𝑡h 𝑡𝑒𝑎𝑐h𝑒𝑟 𝑖𝑠𝑛𝑜𝑡 h𝑎𝑝𝑝𝑦 .
𝑛𝑜𝑡 𝑓𝑢𝑛 𝑎𝑛𝑑 𝑚𝑦 𝑚𝑎𝑡h 𝑡𝑒𝑎𝑐h𝑒𝑟 𝑖𝑠 𝑠𝑎𝑑 .
DISJUNCTION
The disjunction of a propositions p and q is denoted by
 
𝑝 ∨𝑞 : (𝑟𝑒𝑎𝑑 𝑎𝑠 ′ 𝑝 𝑜𝑟 𝑞 ′ )
𝑝 ∨𝑞
 

and defined
p q
through its truth
value:
T T T
T F T
F T T
F F F
E XAM PLE S :
 
𝑬𝒙𝒑𝒓𝒆𝒔𝒔 𝒕𝒉𝒆 𝒇𝒐𝒍𝒍𝒐𝒘𝒊𝒏𝒈 𝒊𝒏 𝒔𝒆𝒏𝒕𝒆𝒏𝒄𝒆𝒔 𝒐𝒓 𝒊𝒏 𝒔𝒚𝒎𝒃𝒐𝒍𝒔
 
𝑝 : 𝐴𝑟𝑐𝑦 h𝑎𝑠 𝑎 𝑑𝑎𝑡𝑒 𝑤𝑖𝑡h
 
𝑟 :𝑋𝑦𝑧𝑎
𝑁 𝑖 ñ.𝑜 𝑖𝑠 𝑒𝑎𝑡𝑖𝑛𝑔 .
 
𝑞 : 𝐺 𝑙𝑒𝑛𝑛 𝑖𝑠 𝑠𝑙𝑒𝑒𝑝𝑖𝑛𝑔 .
 
𝑝 ∨ 𝑞 :  𝐴𝑟𝑐𝑦 h𝑎𝑠 𝑑𝑎𝑡𝑒 𝑤𝑖𝑡h 𝑋𝑦𝑧𝑎 𝑜𝑟 𝐺𝑙𝑒𝑛𝑛 𝑖𝑠 𝑠𝑙𝑒𝑒𝑝𝑖𝑛𝑔 .
 
𝑞 ∨ ( 𝐸𝑖𝑡h𝑒𝑟
𝑟 ): 𝐺𝑙𝑒𝑛𝑛 𝑖𝑠 𝑠𝑙𝑒𝑒𝑝𝑖𝑛𝑔 𝑜𝑟 𝑁𝑖 ñ 𝑜𝑖𝑠 𝑛𝑜𝑡 𝑒𝑎𝑡𝑖𝑛𝑔 .
 

 
𝑝 ∨( 𝑞 ∨ 𝑟 ):
 
Implications
These are conditional statements which are sometimes
called as if-then statements. The part is called the
hypothesis or premise and the “then” part is called the
conclusion. The hypothesis and conclusion may be
represented by P and Q respectively and the implication is
represented by P → Q.
Example

The statement “ if I got perfect score in the examination, then I


will treat you to lunch” is a conditional statement where the
hypothesis is “I got perfect score in the examination” and the
conclusion is “I will treat you lunch”.

P: I got perfect score in the examination


Q: I will treat you lunch
P → Q: if I got perfect score in the examination, then I
will treat you lunch.

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