0% found this document useful (0 votes)
118 views35 pages

MTK3013-Chapter1.1 Propositional Logic

The document discusses propositional logic and how it uses propositions that are either true or false. It provides examples of statements and determines if they are propositions or not, and identifies their truth value. It also explains logical operators like negation, conjunction, disjunction, implication and biconditional, and how they combine propositions. Finally, it discusses conditional statements and their converse, inverse and contrapositive.

Uploaded by

fadzniaidil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
118 views35 pages

MTK3013-Chapter1.1 Propositional Logic

The document discusses propositional logic and how it uses propositions that are either true or false. It provides examples of statements and determines if they are propositions or not, and identifies their truth value. It also explains logical operators like negation, conjunction, disjunction, implication and biconditional, and how they combine propositions. Finally, it discusses conditional statements and their converse, inverse and contrapositive.

Uploaded by

fadzniaidil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 35

http://fskik.upsi.edu.

my

LOGIC and PROOF


1.1 Propositional Logic

MTK3013
DISCRETE STRUCTURES
http://fskik.upsi.edu.my

Logic
Crucial for mathematical reasoning
Important for program design
Used for designing electronic circuitry

(Propositional )Logic is a system based on propositions.


A proposition is a (declarative) 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).
Corresponds to 1 and 0 in digital circuits
http://fskik.upsi.edu.my

The Statement/Proposition Game

Elephants are bigger than mice.

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? true
http://fskik.upsi.edu.my

The Statement/Proposition Game

520 < 111

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? false
http://fskik.upsi.edu.my

The Statement/Proposition Game

y > 5

Is this a statement? yes


Is this a proposition? no

Its truth value depends on the value of y, but


this value is not specified.
We call this type of statement a propositional
function or open sentence.
http://fskik.upsi.edu.my

The Statement/Proposition Game

Today is January 25 and 99 < 5.

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? false
http://fskik.upsi.edu.my

The Statement/Proposition Game

Please do not fall asleep.

Is this a statement? no
Its a request.

Is this a proposition? no

Only statements can be


propositions.
http://fskik.upsi.edu.my

The Statement/Proposition Game


If elephants were red,
they could hide in cherry trees.

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? probably false
http://fskik.upsi.edu.my

The Statement/Proposition Game


x < y if and only if y > x.
Is this a statement? yes
Is this a proposition? yes
because its truth value
does not depend on
specific values of x and y.
What is the truth value
of the proposition? true
http://fskik.upsi.edu.my

Combining Propositions

As we have seen in the previous examples, one or


more propositions can be combined to form a
single compound proposition.

We formalize this by denoting propositions with


letters such as p, q, r, s, and introducing several
logical operators.
http://fskik.upsi.edu.my

Logical Operators (Connectives)


We will examine the following logical operators:
Negation (NOT)
Conjunction (AND)
Disjunction (OR)
Exclusive or (XOR)
Implication (if then)
Biconditional (if and only if)
Truth tables can be used to show how these operators
can combine propositions to compound propositions.
http://fskik.upsi.edu.my

Negation (NOT)
Unary Operator, Symbol:

p p
true false
false true
http://fskik.upsi.edu.my

Conjunction (AND)
Binary Operator, Symbol:

p q pq
true true true
true false false
false true false
false false false
http://fskik.upsi.edu.my

Disjunction (OR)
Binary Operator, Symbol:

p q pq
true true true
true false true
false true true
false false false
http://fskik.upsi.edu.my

Exclusive Or (XOR)
Binary Operator, Symbol:

p q pq
true true false
true false true
false true true
false false false
http://fskik.upsi.edu.my

Implication (if - then)


Binary Operator, Symbol:

p q pq
true true true
true false false
false true true
false false true
http://fskik.upsi.edu.my

1. A conditional statementis a statement that


_________________
if-then
can be expressed in ________form.

2. A conditional statement has _________.


two parts
hypothesis is the ____
The __________ if part.
The __________
conclusion is the then
______ part.
http://fskik.upsi.edu.my

Conditional Statement
If p, then q A sufficient
If p, q condition for q is p
p is sufficient for q q whenever p
q if p q is necessary for p
An necessary q follows from p
condition for p is q
p implies q
p only if q
http://fskik.upsi.edu.my

Example :
p : Maria learns Discrete Structures
q : Maria will find a good job. Express the
statement p q.
http://fskik.upsi.edu.my

Converse, Contrapositive and


Inverse
To fully analyze this conditional statement, we
need to find three new conditionals:

Converse
Inverse
Contrapositive
http://fskik.upsi.edu.my

Converse
The ________
converse of a conditional statement is
formed by switching the hypothesis and the
conclusion.
Example:
(Conditional) If I am sleeping, then I am
breathing.
(Converse) If I am breathing, then I am
sleeping.
http://fskik.upsi.edu.my

Inverse
The ________
inverse of a conditional statement is
formed by negating (inserting not) the
hypothesis and the conclusion.
Example:
(Conditional) If I am sleeping, then I am
breathing.
(Inverse) If I am not sleeping, then
I am not breathing.
http://fskik.upsi.edu.my

Contrapositive
contrapositive
The ______________ of a conditional
statement is formed by negating the
hypothesis and the conclusion of the
converse.
Example:
(Converse) If I am breathing, then I am
sleeping.

(Contrapositive)If I am not breathing, then I


am not sleeping.
http://fskik.upsi.edu.my

Conditional If I am sleeping, then I am


( p q) breathing.
Inverse If I am not sleeping, then I am
p -> q not breathing.
Converse If I am breathing, then I am sleeping.
q->p
Contrapositive If I am not breathing, then I am not
p -> q sleeping.
http://fskik.upsi.edu.my

The conditional statement, inverse, converse


and contrapositive all have a truth value. That
is, we can determine if they are true or false.

When two statements are both true or both


false, we say that they are logically equivalent.
http://fskik.upsi.edu.my

Practice :
Conditional If m<A = 30, then <A is
acute.
Inverse
(insert not)
Converse
(switch)
Contrapositive
(switch then
insert not)
http://fskik.upsi.edu.my

Conclusion
The conditional statement and its contrapositive
have the same truth value.

They are both true.

They are logically equivalent.


http://fskik.upsi.edu.my

Identify the underlined portion of


the conditional statement.

A. hypothesis
B. Conclusion
C. neither
http://fskik.upsi.edu.my

Identify the underlined portion of


the conditional statement.

A. hypothesis
B. Conclusion
C. neither
http://fskik.upsi.edu.my

Identify the converse for the


given conditional.

A. If you do not like tennis, then you do not


play on the tennis team.
B. If you play on the tennis team, then you like
tennis.
C. If you do not play on the tennis team, then
you do not like tennis.
D. You play tennis only if you like tennis.
http://fskik.upsi.edu.my

Identify the inverse for the given


conditional.

A. If 2x is not even, then x is not odd.


B. If 2x is even, then x is odd.
C. If x is even, then 2x is odd.
D. If x is not odd, then 2x is not even.
http://fskik.upsi.edu.my

Biconditional (if and only if)


Binary Operator, Symbol:

P Q PQ
true true true
true false false
false true false
false false true
http://fskik.upsi.edu.my

Statements and Operators


Statements and operators can be combined in any way to
form new statements.

P Q P Q (P)(Q)
true true false false false
true false false true true
false true true false true
false false true true true
http://fskik.upsi.edu.my

Statements and Operations


Statements and operators can be combined in any way to
form new statements.

P Q PQ (PQ) (P)(Q)
true true true false false
true false false true true
false true false true true
false false false true true
http://fskik.upsi.edu.my

Equivalent Statements
P Q (PQ) (P)(Q) (PQ)(P)(Q)

true true false false true


true false true true true
false true true true true
false false true true true
The statements (PQ) and (P)(Q) are logically equivalent,
because (PQ)(P)(Q) is always true.

You might also like