0% found this document useful (0 votes)
108 views23 pages

Introduction To Logic & Proof

This presentation introduces logic and proof. It defines logic as the study of valid and invalid arguments. A statement is a declarative sentence that is either true or false. Statements can be represented symbolically using letters. The presentation covers negation, conjunction, disjunction, and methods of direct proof, proof by contradiction, and proof by contrapositive. Examples are provided to illustrate each concept and method of proof.

Uploaded by

Aqsa Tabassum
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)
108 views23 pages

Introduction To Logic & Proof

This presentation introduces logic and proof. It defines logic as the study of valid and invalid arguments. A statement is a declarative sentence that is either true or false. Statements can be represented symbolically using letters. The presentation covers negation, conjunction, disjunction, and methods of direct proof, proof by contradiction, and proof by contrapositive. Examples are provided to illustrate each concept and method of proof.

Uploaded by

Aqsa Tabassum
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/ 23

Presentation

Topic: Introduction to Logic & Proof


LOGIC:

Logic is the study of the principles and methods that


distinguish between a valid and an invalid argument.
SIMPLE STATEMENT:

A statement is a declarative sentence that is either true


or false but not both. A statement is also referred to as a
proposition.
EXAMPLES:

Propositions
1)Grass is green.
2) 4 + 2 = 6
3) 4 + 2 = 7
4) There are four fingers in a hand
Not Propositions
1) Close the door.
2) x is greater than 2.
3) He is very rich
SYMBOLIC REPRESENTATION:

Statements are symbolically represented by letters such as


p, q, r,...
EXAMPLES:
p = “Islamabad is the capital of Pakistan”
q = “17 is divisible by 3”
TRANSLATING FROM ENGLISH TO SYMBOLS:

Let p = “It is hot”, and q = “ It is sunny”


SENTENCE SYMBOLIC FORM
1.It is not hot. ~p
2.It is hot and sunny. p ∧q
3.It is hot or sunny. p∨q
4.It is not hot but sunny. ~ p ∧q
5.It is neither hot nor sunny. ~p∧~q
NEGATION (~):

If p is a statement variable, then negation of p, “not p”, is denoted


as “~p” It has opposite truth value from p i.e., if p is true, then ~ p
is false; if p is false, then ~ p is true.
CONJUNCTION (∧):
If p and q are statements, then the conjunction of p
and q is “p and q”, denoted as “p ∧ q”.

 DISJUNCTION (∨) or INCLUSIVE OR

If p & q are statements, then the disjunction of p and q


is “p or q”, denoted as “p ∨ q”.
Direct Method of Proof

A direct proof of p→q is logical valid argument in


which we start whit the assumption that “ p” is
true and then using “ p” as will as other axioms show
directly that“ q” is true
Example #1

“ The product of two odd integers is odd”


p→q, X and y be two odd integers
x=2n+1 y=2m+1
xy = (2n+1 )(2m+1)
= 4mn+2n+2m+1
=2(2mn+n+m)+1
a= 2mn+ n+m
=2a+1
Example # 2

 Show that square of an even no is an even


no. 2 2 =4 , 44=16
Let x be an even no x=2n
x2=(2n)2=4n2
x 2 =2(2n)2 (2n2 =a)
x2 =2a
Hence x 2 is also even
Example # 3

Show that sum of two odd no is an even no


P: x is odd and y is even
x=2n+1 y=2m+1
x+y =2n+1 +2m+1
=2m+2n+2
2(m+n+1) (m+n+1=a)
x+y =2a
Hence (x + y)is even :-
Indirect Methods of Proof

Proof by the Contra positive:-


Def: It say that (p→q) is logical equivalent to it contra
positive ( ¬q→¬p)
Show by the truth table

p q ¬p ¬q p→ q ¬q→¬p

T T F F T T

T F F T F F

F T T F T T

F F T T T T
Example

Prove that if n2 is odd, then n is odd:


p: n2 is odd q: n is odd

Proof by contra positive: ¬q→¬p


¬q: n is even
¬p: n2 is even

n= 2x
n2= (2x)2
n2= 4x2
n2= 2( 2x 2)
n2= 2a
Example #2

Prove that “if x,y (Set of integer)” Such that xy is odd then
both x & y are odd:
By method of contra positive:
¬q → ¬p
x and y are even:
xy is even:

x= 2n y= 2m
xy= 2n x 2m
xy= 4nm
xy= 2(2mn)
xy = 2a

xy= 2a is even
Example#3

Prove the following statement “If 3n+2 is odd", then n is odd:


p: 3n+2 is odd:
q: n is odd:
By method of contra positive:
¬q → ¬p
¬q: n is even:
¬p: 3n+2 is even:
n=2a
n= 3(2a) + 2
n=6a+2
n=2(3a+1)
n=2b
Proof by Contradiction

In this, we assume that q is false (¬q is true)


then by logical argument we arrive at
situation where ¬q implies a contradiction.
This can happen only when ¬q is false, which
implies that q must be true:
Example # 4

p: 3n+2 is odd


q: n is odd
Assume that q is false(¬q is true)
¬q: n is even
n= 2k
3n+2 = 3(2k) + 2
3n+2 =6k +2
3n+2 =2(3k+1)
3n+2 =2a
(3n+2) is even
There is contradiction, which means, q is true:
Example #5

Show that for , if x3 + 4x = 0 then x = 0


p: x3 + 4x = 0
q: x=0
Method of contradiction ¬q is true:
x is not equal to 0
(x3 + 4x = 0 )
x(x2+4) = 0
(x2+4) = 0
x2 = -4 Not Possible
Hence the given Statement is true:
Questioning Time Starts Now………..
Presented By:

M Akhlaq Roll No: 2235


Kamran Hassan Roll No: 2246
Danish Rizwan Roll No: 2249

Thanks

You might also like