CHAPTER 2

THE NATURE OF LOGIC

BY:
HANISAH SAINUDDIN
MOHD FIRDAUS
ADDININ
NORFARAHAIN JOHANIS
 THE NATURE OF LOGIC

DEDUCTIVE TRUTH TABLES AND

REASONING THE CONDITIONAL

OPERATIONS AND THE NATURE OF

LAWS OF LOGIC PROOF

PROBLEM
LOGIC
SOLVING USING
LOGIC CIRCUITS
2.1 DEDUCTIVE REASONING

TERMINOLO
GY ORDER OF
OPERATIONS

CONJUNCTIO
N
NEGATION

DISJUNCTIO
N
TERMINOLOGY
 ARGUMENT
1. If you read the Times, then you are well informed.
2. You read the Times.
3. Therefore, you are well informed.
 If 1 and 2 are true = 3 also true.
 1 and 2 are called the hypotheses.
 3 is called the conclusion.
 This is called Deductive Reasoning.
CONJUNCTION
 If p and q represent two simple statements, then “p and
q” is the compound statement.
 Using operator called conjunction.

 Word “and” is symbolized by .

p q p and q
TRUE TRUE TRUE
TRUE FALSE FALSE
FALSE TRUE FALSE
FALSE FALSE FALSE
DISJUNCTION
 The operator or, denoted by .
 The meaning of this simple word is ambiguous.

 “p q” means “p or q”.

p q p or q
TRUE TRUE TRUE
TRUE FALSE TRUE
FALSE TRUE TRUE
FALSE FALSE FALSE
NEGATION
 The operator not, denoted by ~, is called negation.
 The negation of a true statement is false.

 The negation of a false statement is true.

 Eg : statement t: Otto is telling the truth.

 ~t : Otto IS NOT telling the truth/it is not the case that

Otto is telling the truth.
 Negation of All, some and No.

statement Negation
All Some…not
Some No
Some…not All
no some
ORDER OF OPERATIONS
 Parentheses “( )” are used to indicate the order of
operations.
 ~ (n c) = the negation of the statement “n and c”.
 “not n and c”.

 Eg : Let p: I eat spinach; q:I am strong.

 The translation of p q is “I eat spinach, and I am

strong”.
 TRUTH TABLES
&
THE CONDITIONAL
 A convenient and helpful way to organize truth values
of various statements is in a truth table. A truth
table is a table whose columns are statements, and
whose rows are possible scenarios. The table contains
every possible scenario and the truth values that
would occur. One of the simplest truth tables records
the truth values for a statement and its negation.
EXAMPLE
 Construct a truth table for the compound statement:

Gi Kwang did not come last night

and did not pick up his money.
CONDITIONAL
 “ IF P, then q” is called a condition statement.
P q
 P is called the antecedent, and q is called the
consequent.
 Example:
If I receive my check tomorrow, then I will pay
you the rm 10 that I owe you.

P: I receive my check tomorrow

Q: I will pay you the RM 10 that I owe you
 Given the conditional p q, we define:

The converse ia q p
Inverse: ~p ~q
Contrapositive: ~q ~p
 OPERATORS
AND LAWS OF
LOGIC
IMPLICATIO
NS, AND
LOGICAL
EQUIVALEN
CE.
BICONDITIONAL

p q
Also writen as

p q
p=q
p EQ q
DEFINITION OF BICONDITIONAL
p q p q
T T T
T F F
F T F
F F T

1. p if and only if q.
2. q if and only if p.
3. If p then q, and conversely.
4. If q then p, and conversely
 The set of logical possibilities for which a given
statement is true is called its truth set.
 A logical statement in which the conclusion is equivalent
to the premise is called a tautology.
 This mean that a compound statement is a tautology if
you obtain only Ts on a truth table.
EXAMPLE
p q pVq ~q ~q→p (p V q) → (~ q → p)

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

If combinational is a tautology, then it is called an implication

and is symbolized by ⇒.
The implication symbol p ⇒ q is promounced “p implies q”

A biconditional statement p → q that is also a tautology (that is

alwayts true) is a logical equivalence, written p ⇔ q znd read “p
is logically equivalent to q”
LAWS OF LOGIC
 Law of double negation : ~ (~p) ⇔ p
 Law of contraposition : (~q → ~q) ⇔ ( p → q)

De Morgan’s Laws
~ (p V q) ⇔ ~p Λ ~q
~ (p Λ q) ⇔ ~p V ~q
p q p Λ q ~ (p Λ ~p ~q ~p V ~ (p Λ q) ⇔ ~p
q) ~q V ~q

T T T F F F F T
T F F T F T T T
F T F T T F T T
F F F T T T T T
THE NATURE OF PROOF

DIRECT
REASONING
INDIRECT
REASONING FALLACY OF
THE
TRANSITIVE CONVERSE
REASONING FALLACY OF
THE
LOGICAL PROOF INVERSE

FALSE CHAIN
FALLACIES PATTERN
DIRECT REASONING
 Consist of two premises, or hypotheses and a conclusion.
p q if you receive an A on the final, then you will
pass the course.
 you receive an A on the final.
therefore, you pass the course.
 also called modus ponens, law of detachment or
assuming the antecedent.
INDIRECT REASONING
 p q If you receive an A on the final, then you will pass the
course.
 you did not pass the course.
therefore, you did not receive an A on the final.
 Also called modus tollens or denying the consequent.

 eg: If x is an even number, then 3x is an even number.

3xXisis not an even number.

not an even number.
TRANSITIVE REASONING
 p q If you attend class, you will pass the
course.


 Eg. If you attend class, then you will pass the

course.
If you pass the course, then you will
graduate.
Solution:
if you attend class, then you will graduate.
LOGICAL PROOF
1. If I receive a check for RM 5000, then we will go on vacation.
2. If the car breaks down, then we will not go on vacation.
3. The car breaks down.
Solution:
4. c v where c: I receive a RM 5000 check.
5. b ~v v: we will go on vacation.
6. B b: the car breaks down.
Simplify the argument.
b ~v
Finally, we translate the conclusion
1’. ~v ~c back into words: I did not receive a
b ~c check for RM 5000.
~c
FALLACIES
1. Fallacy of the converse
 If a person reads the Times, then she is well informed.

this person is well informed.

therefore, this person reads the Times.
-p q ; q
p.
2. Fallacy of the inverse
 If a person reads the Times, then he is well informed.

This person does not read the Times.

therefore, this person is not well performed.
 p q ; ~p
~ q.

3. False chain pattern

 hot, humid weather favors thunderstorms.

hot, humid weather favors bacterial growth, which causes

milk to sour.
therefore, thunderstorms cause milk to sour.
p q ; p r
q r
PENYELESAIAN
MASALAH
MELIBATKAN
LOGIK
CONTOH
1. Semua yang berkasut merah ialah pemain bola.
2. Ali berkasut merah.
 Oleh itu, Ali ialah pemain bola.

1. Haiwan, tumbuhan dan manusia perlukan air, udara dan makanan untuk
hidup.
 Oleh itu, semua hidupan perlukan air, udara dan makanan untuk hidup.

1. Haiwan mamalia melahirkan anak.

2. Anjing dan kucing melahirkan anak.
 Oleh itu, anjing dan kucing merupakan haiwan mamalia.

*Boleh diwakilkan dengan menggunakan set.

 “SESI PERAH OTAK”

 A carpenter was in a terrible hurry. He had to work as

quickly as possible to cut a very heavy 10 foot plank into
10 equal sections. If it takes 1 minute per cut, how long
will it take him to get the 10 equal pieces?
 Answer
 9 minutes. It only takes 9 cuts to get 10 equal sections.
 Johnny's mother had three children. The first child was
named April. The second child was named May. What
was the third child's name?
 ANSWER
 It has to be Johnny. He's the third child!
 Can a non-veteran man living in the Washington D.C.
area be buried in Arlington National Cemetery?
 ANSWER
 No, it is not legal to bury people who are alive.
LOGIC CIRCUITS
 Series circuit
 Parallel circuit

 AND-gate

 OR-gate

 NOT-gate