CSC510 Lecture Slides 24/10/2017

Are these arguments valid?

 If Tom can sing or the CD player can function, I will buy
the CD. Tom can sing, I will buy the CD player.
Methods of Proof Therefore, I will buy the CD and the CD player.

 Everyone in the CSC510 class loves Proofs. Someone

in the CSC510 class has never taken Logic.
Muthukkaruppan Annamalai Therefore, someone who loves Proofs has never taken
mk@tmsk.uitm.edu.my logic.

24/10/2017 mk 2

Proof Direct Proof

 A proof is an argument that establishes the truth (or the PQ
validity) of a proposition
 We only need to consider the case P is true because
 A simple argument consists of hypotheses and a when is false, the argument is true (by default)
conclusion, is of the form F1, F2, …, Fn  G, where Fi  Assume the hypothesis P is true, P Q PQ
and G are logical propositions and together with other axioms 0 0 1
0 1 1
and inference rules, we deduce
 In constructing a proof, ensure the arguments used are Q is true
1 0 0
1 1 1
valid (c.f. factual definitions, axioms and inference rules)
 Therefore, P is true; so the proposition is correct
 The process of deducing a conclusion from a set of
hypotheses is deductive reasoning  e.g. (mathematics) Prove that
1. For all real numbers x, if x is even, then x2 is also even
2. For all integers m, n, if m and n are odd, then m * n is odd

24/10/2017 mk 3 24/10/2017 mk 4

mk 1
CSC510 Lecture Slides 24/10/2017

Indirect Proof (by Contrapositive) Proof by Cases

P  Q ≡ Q  P; P  P = false (contradiction) P  Q, where P = P1 ⋁ P2 ⋁ … ⋁ Pn
 Assume the hypothesis P is true, P Q PQ
 If the hypothesis naturally breaks down into parts
(P1 ⋁ P2 ⋁ … ⋁ Pn), we prove P1  Q, P2  Q, …, Pn  Q
but conclusion Q is false 0 0 1
0 1 1
 Using the hypothesis P and ¬Q, and 1 0 0
 Hence P (the whole of parts) is true; so the proposition is
1 1 1
together with other axioms and correct
inference rules, we derive a contradiction
 e.g. (mathematics) Prove that
 Therefore, P exist; so the proposition is correct
1. For all real numbers x, y, | x | + | y | ≤ | x + y |
 e.g. (mathematics) Prove that 2. For all real numbers x, y, max(x, y) + min(x, y) = x + y
1. For all real numbers x, y, if x + y > 2, then x > 1 or y > 1
2. For all integers m, n, if m + n is odd, then m is odd and n is even

24/10/2017 mk 5 24/10/2017 mk 6

Proving Universally Quantified Proving Existentially Quantified

Logical Proposition Logical Proposition
 To prove X p(X) is true, we exhaustively show that for  To prove X p(X) is true, we provide an
every X in the DoD, p(X) is true, i.e., it is satisfiable by example to show that the proposition is
any value for X in the DoD satisfiable in the DoD, i.e., there is a value for X
in the DoD that makes p(X) true
 To prove X p(X) is false, we provide a counter-
example to show that there exist a value for X in the DoD  To prove X p(X) is false, we show that the
that makes p(X) false proposition is unsatisfiable, i.e., every X in the
DoD makes p(X) false
 Check
1. Prove that X (bird(X) ⋀ ¬canFly(X)) is true
1. X (int(X)  (X2 > 0))
2. Let x and y be prime numbers with x < y. Prove that there is a
2. All prime numbers are odd prime number z satisfying x < z < y
3. If x < y, then x2 < y2 3. Let x and y be non-zero integers. Prove that there is a non-
zero integer z satisfying √x2 + y2
24/10/2017 mk 7 24/10/2017 mk 8

mk 2
CSC510 Lecture Slides 24/10/2017

Exercise
1. For all real numbers d1, d2, if n = min (d1, d2) and x < n,
then x < d1 and x < d2
2. Prove that for all integers m, n, if m and n are even,
then m + n is even
3. For all integers, prove that n is even if and only if n2 is
even.
4. Prove that the following argument is valid:
(P  Q)  R; (P  R); (Q  R) /  Q  (P  R)

24/10/2017 mk 9

mk 3