Elementary Logic

What is Logic?
 Crucial for mathematical reasoning

 Logic is a system based on propositions.

 A proposition is a statement that is either true or false (not both).
 We say that the truth value of a proposition is either true (T) or false
(F).
 LOGIC
Logic comes from the word “LOGOS”,
which means “REASON”. It is concerned with
the methods and rules for correct thinking.
 LOGIC: THE SCIENCE AND ART
OF REASONING
•Logic, as an ART, on one hand, direct reason. As
an ART it guides man’s reason so that he can
proceed with order and precision in the search for
meaning.
•Logicas a SCIENCE, on the other
hand, “investigates, discovers,
expresses, systematizes,
demonstrates, and explains the laws of
correct thinking.
 Definition of Terms
Conditional Statement – An If-then statement

Hypothesis – The part following ‘if’ in a conditional statement.

Conclusion - the part following the ‘then’ in a conditional statement.

TRUTH VALUE - Means every conditional statement is either true or false.

FUNDAMENTALS of LOGIC

Definition
A proposition P is a declarative statement
that is true or false but not both.

If P is true, P is assigned the truth value 1.

If P is false, P is assigned the truth value 0.

7
 Examples of Propositions

1. It is raining.

2. When you work hard, you are

rewarded with success.

3. There are seven days in one week.

8
The following are not propositions

1. Get out!

2. Logic is sweet.

3. x + 3 = 5

4. How old are you?

9
 Logical Connectives

A word or symbol that joins two

sentences to produce a new one.
Definition
The negation of a propostion P ,
denoted by P  read as " not P " ,
is the propostion whose truth value
depends on P as shown below.
Truth Table
P P
1 0
0 1 11
Symbol Translation
Not P;
P It is not the case that P;
It is false that P;
It is not true that P

12
Definition

Let P and Q be propositions. The

conjunction of P and Q, denoted
by P  Q  read as " P and Q  is the
proposition whose truth value
depends on P and Q.
We call each P and Q a conjunct.
13
Symbol Translation
P and Q;
P moreover Q;
P although Q;
P still Q;
PQ P furthermore Q;
P also Q;
P nevertheless Q;
P however Q;
P yet Q;
P but Q
14
Let P: Life is beautiful.
Q: Life is challenging.

1. PQ

2. P  Q

3. P  Q
4. P  Q
15
Definition
Let P and Q be propositions. The
disjunction of P and Q, denoted
by P  Q  read as " P or Q  is the
proposition whose truth value
depends on P and Q.
We call each P and Q a disjunct.
16
Symbol Translation

P or Q;
PQ P unless Q;

17
Let P: 2 is prime.
Q: 2 is even.
1. PQ
2. P  Q
3. P  Q
4. P  Q

18
CONDITIONAL STATEMENTS
CONDITIONAL STATEMENTS
Conditional Statement/ Implication
Let p and q be a proposition. The
implication is the proposition that is
FALSE when p is true, q is false.
Otherwise is TRUE.
p = hypothesis/antecedent/premise
pq
q = conclusion/consequence
Express: “ if p, then q”, “q when p”, “p
implies q”
Eg: If Joseph got 100% in logic then he is
smart.
CONDITIONAL STATEMENTS
p ( q
The Truth Table for the Implication )

p q

pq
T T T

T F F

F T T

F F T
Definition
Let P and Q be propositions. The
conditional statement or implication
" if P then Q " denoted by P  Q, is
the proposition whose truth value
depends on P and Q.
We call P the hypothesis or premise
and we call Q the conclusion.
22
Symbol Translation
If P then Q;
P implies Q;
P is a sufficient condition for Q;
P only if Q;
PQ Q is a necessary condition for P;
Q if P;
Q follows from P;
Q provided P;
Q whenever P;
Q is a logical consequence of P
23
Example Conditional Statement
Hypothesis, Conclusion

If it rains, then the ground will be wet.

Hypothesis: it rains
Conclusion: the ground will be wet.
 The Mad Hatter states: “You might just as
well say that ‘I see what I eat’ is the same
thing as ‘I eat what I see’!” Provide a
counterexample to show that one of the Mad
Hatter’s statements is false. (Excerpts from
Alice in Wonderland)

 The statement “I eat what I see” written as a conditional

statement is “If I see it, then I eat it.”

 This conditional is false because there are many things you see
that you do not eat.

 One possible counterexample is “I see a car on the road, but I do

not eat the car.”
“Buy one notebook, take one free pencil.”
P: I buy a notebook.
Q: I get a free pencil.

a. If I buy a notebook then I get a free

pencil.
b. If I buy a notebook then I don’t get a
free pencil.
c. If I don’t buy a notebook then I get a
free pencil.
d. If I don’t buy a notebook then I don’t get
a free pencil.
26
 “If I get my salary today, then I treat you
to
dinner.”
a. I get my salary today and then, I treat
you to dinner.
b. I get my salary today and then, I don’t
treat you to dinner.
c. I don’t get my salary today and then, I
treat you to dinner just the same.
d. I don’t get my salary today and then I
don’t treat you to dinner.

Under what situation is the promise broken?

27
Definition

Let P and Q be propositions. The

biconditional statement
" P if and only if Q ", denoted by
P  Q, is the proposition whose
truth value depends on P and Q.

28
Symbol Translation

P if and only if Q;
P is equivalent to Q;
PQ
P is a necessary and sufficient
condition for Q;

29
More on Propositions

Domain

Hypothesis

Conclusions

30
proposition
 More on Conditional Statements

Implication: If P Then Q.
P: antecedent or hypothesis
Q: consequent or conclusion
Conditional If P then Q.
Inverse: If not P then not Q.
Converse: If Q then P.
Contrapositive: If not Q then not P.

34
 More on Conditional Statements

Give the converse, inverse and contrapositive of the

following implications.

1. If you are more than 60 years old, then you are

entitled to a senior citizen card.

2. If P is prime then it is odd.

35
 Quantification
A construct that specifies the quantity of
specimens in the domain of discourse
that satisfy the open formula.

• Universal Quantification
• Existential Quantification
 Let U be the universe of discourse.

Definition

The phrase " For all x " is called a universal

quantifier and is denoted by x.

x : " for every x "

" for all x "

" for any x "
37
Definition

The statement " For some x " is called an existential

quantifier and is denoted by x.

x : " there exists an x "

" there is at least one x "

" for some x "

38
 Re mark
Let P  x  denote a propositional function and let U be
the universe for x. The general proposition xP  x  is
true if and only if P  c  is true for all objects c in U .

Truth Table : xP  x 

P  c  is true for every object c in U 1
P  c  is false for at least one object c in U 0

39
Re mark
Let P  x  denote a propositional function and let U be
the universe for x. The general proposition xP  x  is
true if and only if P  c  is true for at least one object
c in U .

Truth Table : xP  x 

P  c  is true for at least one object c in U 1
P  c  is false for every object c in U 0

40
Example Let U  1, 0,1

1. P  x : x3  x

P  1 :  1  1
3
true
P  0 : 0  0
3
true
P 1 : 1  1
3
true
xP  x  is true

41
Example Let U  1, 0,1

2. Q  x : x2  1

Q  1 :  1  1
2
true
Q  0 :  0  1
2
false
Q 1 : 1  1
2
true
xQ  x  is false but xQ  x  is true

42
 Example Let U  1, 0,1

3. S  x : 2x  0

S  1 : 2  1  2  0 false

S  0 : 2  0  0 true
S 1 : 2 1  2  0 false
xS  x  is true

43
Let’s Wrap it up…….
 Logic Helps Develop Clear and Precise Ideas.

 Language conventions are necessary in Mathematics for it to be

understood by all.
Pls. do the exercises
Write if it is a Proposition or Not

1. It is sunny day.
2. Stand up!

3. There is 60 seconds in one minute

4. Squares has 4 equal sides.

5. How are you today?

46
Express the following propositions in symbols,
where P, Q, R, S and T are defined as follows.

P: I understand logic.
Q: I am doing well in my class in Logic.
R: Logic is easy.
S: I will pass all my exams in Logic.
T: Logic is difficult
1. Logic is easy or it is difficult.
2. I understand Logic if and only if it is easy.
3. Although I am doing well in my class in
Logic, I won’t pass all my exams.
4. Logic is easy and I understand it. 47

5. Logic is easy unless it is difficult.

Rewrite the propositions below using the symbols
P Love is blind.
Q Love is sacrifice

1. P^Q
2. P √ -Q
3. –P ^ Q
4. P Q
5. P Q
 Rewrite the statement in
Conditional, Inverse, converse,
contrapositive
P Square has four equal sides.
Q Square has four equal angles.
Thank you