0% found this document useful (0 votes)
28 views89 pages

3.1 - Reasoning (EDITED)

This document discusses logic and reasoning. It defines key concepts such as propositions, truth tables, connectives like conjunction and disjunction, and logical operations like negation. Examples are provided to illustrate these concepts, including constructing truth tables to evaluate compound logical statements. The document aims to explain the basic tools and methods used in logical reasoning.

Uploaded by

angeloesporlas1
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
0% found this document useful (0 votes)
28 views89 pages

3.1 - Reasoning (EDITED)

This document discusses logic and reasoning. It defines key concepts such as propositions, truth tables, connectives like conjunction and disjunction, and logical operations like negation. Examples are provided to illustrate these concepts, including constructing truth tables to evaluate compound logical statements. The document aims to explain the basic tools and methods used in logical reasoning.

Uploaded by

angeloesporlas1
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/ 89

Mathematics in the Modern World – UNIT 3

Reasoning
[Binary Operations]

Department of Mathematics and Physics


College of Science
University of Santo Tomas
REASONING
When did you become a Thomasian?
a patient’s condition or disease
LOGIC the science of reasoning
Statement

LOGIC the science of reasoning


PROPOSITION
Proposition

Examples:

Smoking is
addictive.
LOGIC the science of reasoning
Proposition

Examples:
Staying late at
night increases
the risk of brain
LOGIC
cancer. the science of reasoning
Proposition

Examples:
Twice an
integer is
always an even
LOGIC
integer. the science of reasoning
Proposition

Is this a proposition?

Where do you
live?
LOGIC the science of reasoning
Proposition

Is this a proposition?

Thrice a
number
LOGIC the science of reasoning
Proposition

Is this a proposition?

LISTEN!

LOGIC the science of reasoning


Proposition

Is this a proposition?

Pia is beautiful.

LOGIC the science of reasoning


Proposition

Is this a proposition?

SMART.
LOGIC the science of reasoning
Proposition symbols

Pia is beautiful.

LOGIC p
the science of reasoning
Proposition symbols

Pia is not beautiful.

LOGIC ~p
the science of reasoning
Proposition symbols

SMART.
p
LOGIC the science of reasoning
Negation symbol

~p
LOGIC
NOT SMART.
the science of reasoning
Negation symbol

~
Some reference use
LOGIC
¬
NOT
to denote negation.
~ p is the same as ¬ p.
the science of reasoning
TRUTH TABLE
a tabular
representation of
all the
combinations of
values for inputs
and their
corresponding the science of reasoning
outputs
TRUTH TABLE

p ~p
T F
F T
the science of reasoning
Compound propositions

pq
a proposition
formed by
combining two or

s r
more simple
propositions
LOGIC the science of reasoning
Compound propositions

Examples:
I am a Thomasian.

LOGIC
p the science of reasoning
Compound propositions

Examples:

q
LOGIC
I enjoy flooded areas.
the science of reasoning
Compound propositions

Examples:

p LOGIC
I am a Thomasian. I enjoy flooded areas.

q
the science of reasoning
Connectives

Examples:
and I enjoy flooded areas.
LOGIC
I am a Thomasian

p^ q the science of reasoning


Connectives

Examples:
or I enjoy flooded areas.
LOGIC
I am a Thomasian

p q v
Connectives

Examples:
If
LOGIC
I am a Thomasian then I enjoy flooded areas.

p è q
Conjunction

Let p and q be propositions.


The conjunction, p and q, is
LOGIC
denoted by p ∧ q.

p ∧ q is true if and only if


both p and q are true.of reasoning
the science

Otherwise, false.
Conjunction
p ∧ q is true if and only if both p and q are true. Otherwise,
false.

p q p∧q
T LOGICT T
T F F
F T F
the science of reasoning
F F F
Conjunction
Construct the truth table for ~p ∧ q

p q ~p ~p∧q
T
T
T
F
LOGIC F
F
F
F
F T T T
the science of reasoning
F F T F
Conjunction
Construct the truth table for ~p ∧ ~q

p q ~p ~q ~p ∧ ~q
T
T
T
F
F
F
LOGIC F
T
F
F
F T T F F
the science of reasoning
F F T T T
Conjunction
Construct the truth table for ~(p ∧ q)

p q p ∧ q ~(p∧q)
T
T
T
F
LOGIC T F
T
F
F T F T
the science of reasoning
F F F T
Disjunction
p v q is false if and only if both of p and q are false.
Otherwise, true.

p q pvq
T LOGIC
T T
T F T
F T T
the science of reasoning
F F F
Disjunction
Construct the truth table for p v ~q

p q ~q p v ~q
T LOGIC
T F T
T F T T
F T F F
the science of reasoning
F F T T
Disjunction
Construct the truth table for ~p v ~q

p q ~p ~q ~p v ~q
T
T
T
F
LOGIC
F
F
F
T
F
T
F T T F T
the science of reasoning T
F F T T
Disjunction
Construct the truth table for ~(p v q)

p q p v q ~(p v q)
T
T
T
F
LOGIC T
T
F
F
F T T F
the science of reasoning
F F F T
~p ∧ ~q is exactly the same
the science as ~(p v q)
of reasoning
~(p ∧ q) is exactly the same
the science as ~p v ~q
of reasoning
De Morgan’s Law
De Morgan’s Law
~p ∧ ~q ≡ ~(p v q)
~p v ~q ≡ ~(p ∧ q)
Exclusive disjunction
p ⊕ q is true when exactly one of p and q is true.
Otherwise, false.

p q p⊕q
T T F
T F T
F T T
F F F
Exclusive Disjunction
Construct the truth table for ~p ⊕ q

p q ~p ~p ⊕ q
T
T
T
F
LOGIC F
F
T
F
F T T F
the science of reasoning
F F T T
NAND (not and)
p NAND q or p|q is false when both p and q are true.
Otherwise, true.
p q p|q
T LOGIC
T F
T F T
F T T
the science of reasoning
F F T
NAND (not and)
Construct the truth table for p|~q

p q ~q p|~q
T LOGIC
T F T
T F T F
F T F T
the science of reasoning
F F T T
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T T
T F T F T T T
F T F F T T T
F F T T F T T
T T F T F F F
T F T F T F T
F T F F the science
T of reasoning
F T
F F T T F F F
TRY THIS!
Construct the truth table for ~(p ⊕ ~q) ∧ r
p q ~q (p ⊕ ~q) ~(p ⊕ ~q) r ~(p ⊕ ~q) ∧ r

T T F T F T F
T F T F T T T
F T F F T T T
F F T T F T F
T T F T F F F
T F T F T F F
F T F F the science
T of reasoning
F F
F F T T F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
TRY THIS!
Is (p v q) ∧ r ≡ (p ∧ r) v (q ∧ r)?
p q pvq r (p v q) ∧ r p∧r q∧r (p ∧ r) v (q ∧ r)

T T T T T T T T
T F T T T T F T
F T T T T F T T
F F F T F F F F
T T T F F F F F
T F T F F F F F
F T T F F the science
F ofF reasoning F
F F F F F F F F
LOGIC
CONDITIONAL
STATEMENTS

the science of reasoning


In the example,
If
LOGIC
I am a Thomasian then I enjoy flooded areas.

p è q
Conditional Statement
p èq
p is called the hypothesis,
LOGIC
the premise or the antecedent.

q is called the conclusion or


consequence. the science of reasoning
Conditional Statement

If I am a K-pop then I understand 사랑해.


p LOGIC
q

p: I am a K-pop.
q: I understand 사랑해.
the science of reasoning
Conditional Statement
p q

If p then q.
LOGIC
p is sufficient for q.
q if p.
q is necessary for
the science p.
of reasoning
p only if q.
Conditional Statement
p q

If p then q.
q when p. LOGIC
q follows from p.
the science of reasoning
Conditional Statement
p q is true on the condition the p holds.
An implication is always TRUE except when a true hypothesis leads to a false conclusion.

p
T LOGIC
q p
T T
q

T F F
F Tthe scienceT of reasoning
F F T
Conditional Statement
Construct a truth table for ~p è ~q

p q ~p ~q ~p è ~q
T T F F T
T F F T T
F T T F F
the science of reasoning
F F T T T
Conditional Statement
Note that:

q è p is the converse of p è q.
~q è ~p is the contrapositive of p è q.
~p è ~q is the inverse of p è q.
the science of reasoning
Bi-conditional Statement
p q is true when both (p and q) statements
are the same. Truth values of p & q are either both TRUE or both FALSE.
p q p q
T T T
T F F
F T F
the science of reasoning
F F T
Bi-conditional Statement
Construct a truth table for p ~q.

p q ~q p ~q
T T F F
T F T T
F T F T
the science of reasoning
F F T F
Exercise:
Construct a truth table for (p ∧ q) è (pèq)
p q p∧q p èq (p ∧ q) è (p è q)
T T T T T
T F F F T
F T F T T
F F F T
Tthe science of reasoning
Types of compound propositions

If a compound proposition is always true, it is called


a tautology.

If a compound proposition is always false, it is called


a contradiction or absurdity.

A compound proposition is called a contingency if it


is not a tautology nor a contradiction.
the science of reasoning
An argument is said to be valid if it is a tautology.

the science of reasoning


Types of compound propositions

the science of reasoning


Is this a valid argument?
If you smoke, then you will have lung cancer.
You have lung cancer.
Therefore, you smoke.

the science of reasoning


If you smoke, then you will have lung cancer.
You have lung cancer.
Therefore, you smoke.

p: You smoke.
q: You have lung cancer.
the science of reasoning
If you smoke, then you will have lung cancer.
pèq
You have lung cancer.
q
Therefore, you smoke.
the science of reasoning
p
Hypothesis #1 and Hypothesis #2 must
be combined into a single hypothesis
using the connective “and”.

[(p è q) ∧ q]
NOTE: Do the same thing when you have more than 2 hypotheses.
Combine all of them to form a single conjunction.
Construct a truth table for [(p è q) ∧ q ] è p
p q pèq [(pè q) ∧ q] [(pè q) ∧ q ]è p

T T T T T
T F F F T
F T T T F
F F T F T
the science of reasoning
Is this a valid argument?
If you smoke, then you will have lung cancer.
You have lung cancer.
Therefore, you smoke.

the science of reasoning


Is this a valid argument?
If it rains nonstop, then UST will be flooded.
If is UST is flooded, then there will be
no classes.
It rains nonstop, then there will be no
classes
p: It rains nonstop.
q: UST will be flooded.
r: There are no classes.
If it rains nonstop, then UST will be flooded.
pèq
If is UST is flooded, then there will be no classes.
qèr
It rains nonstop, then there will be no classes.
pèr
Truth table
[(p è q) ∧ (q è r)] è (p è r)
p q p q r qr [(p q) ∧ (qr)] p r [(p q) ∧ (q r)] (p r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p è q) ∧ (q è r)] è (p è r)
p q pèq r qr [(p q) ∧ (qr)] p r [(p q) ∧ (q r)] (p r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p è q) ∧ (q è r)] è (p è r)
p q pè q r qèr [(p q) ∧ (qr)] p r [(p q) ∧ (q r)] (p r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p è q) ∧ (q è r)] è (p è r)
p q p èq r qèr [(pèq) ∧ (qèr)] p r [(p q) ∧ (q r)] (p r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p è q) ∧ (q è r)] è (p è r)
p q pèq r qèr [(pèq) ∧ (qèr)] pèr [(p q) ∧ (q r)] (p r)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Truth table
[(p è q) ∧ (q è r)] è (p è r)
p q pèq r qèr [(pèq) ∧ (qèr)] pèr [(pèq) ∧ (qèr)] è (pèr)

T T T T T T T T
T F F T T F T T
F T T T T T T T
F F T T T T T T
T T T F F F F T
T F F F T F F T
F T T F F F
the science ofTreasoning T
F F T F T T T T
Is this a valid argument?
If it rains nonstop, then UST will be flooded.
If is UST is flooded, then there will be
no classes.
It rains nonstop, then there will be no
classes
http://web.stanford.edu/class/cs103/tools/truth-table-tool
http://web.stanford.edu/class/cs103/tools/truth-table-tool
Mathematics in the Modern World – UNIT 3

END OF UNIT 3

You might also like