Scribd
Upload
13 views

Lecture 2

Uploaded by

REFAT ULLAH
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
13 views

Lecture 2

Uploaded by

REFAT ULLAH
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Discrete Mathematics

Lecture # 2

1
Compound Propositions
Produced from existing propositions by combining them
using logical operators.
Logical Operators or Connectives

1. Not 
2. And ˄
3. Or ˅
4. Exclusive or 
5. Implication 
6. Biconditional 
Compound Propositions
Negation of a proposition
Let p be a proposition. The negation of p, denoted by
 p (also denoted by ~p), is the statement

“It is not the case that p”.


The proposition  p is read as “not p”. The truth
values of the negation of p,  p, is the opposite of the
truth value of p.
Examples
1. Find the negation of the following proposition

p : It is below freezing
The negation is
“it is not the case that it is below freezing”
which can be more simply expressed by

 p : It is not below freezing.


Examples

2. Write the negation of

“6 is negative”.
The negation is

“It is not the case that 6 is negative”.


or “6 is nonnegative”.
Problem
Discuss the negation of each of these propositions.
a) Steve has more than 100 GB free disk space on his
laptop.
b) Zach blocks e-mails and texts from Jennifer.
c) 7·11·13=999.
d) Diane rode her bicycle 100 miles on Sunday.
Truth Table (NOT)

• Negation Operator, Symbol: 

p p

T(1) F(0)

F(0) T(1)
Conjunction (AND)

Definition
Let p and q be propositions. The conjunction
of p and q, denoted by p˄q, is the proposition
“p and q”.
The conjunction p˄q is true when p and q are
both true and is false otherwise.
The value of p˄q =min(p,q)
Examples

1. Find the conjunction of the propositions p and q, where

p :It is below freezing.


q : It is snowing.
The conjunction is

p˄q : It is below freezing and it is snowing.


Truth Table (AND)
• Binary Operator, Symbol: 

p q pq p q pq
T T T 1 1 1
T F F 1 0 0
F T F 0 1 0
F F F 0 0 0
Disjunction (OR)

Definition
Let p and q be propositions. The disjunction
of p and q, denoted by p˅q, is the proposition
“p or q”.
The disjunction p˅q is false when both p and
q are false and is true otherwise.
The value of p ˅ q =max(p,q)
Examples

1. Find the disjunction of the propositions p and q,


where

p :You have the flu.


q :You miss the final examination
The disjunction is

p˅q : You have the flu OR you miss the final


examination.
Truth Table (OR)

• Binary Operator, Symbol: 

p q pq p q pq
T T T 1 1 1
T F T 1 0 1
F T T 0 1 1
F F F 0 0 0
Exclusive OR (XOR)

Definition
Let p and q be propositions. The exclusive or
of p and q, denoted by pq, is the proposition
“pq”.
The exclusive or, p  q, is true when exactly
one of p and q is true and is false otherwise.
Examples

1. Find the exclusive or of the propositions p and q,


where

p : Atif will pass the course MATH 161.


q : Atif will fail the course MATH 161.
The exclusive or is

pq : Atif will pass or fail the course MATH


161.
Truth Table (XOR)

• Binary Operator, Symbol: 

p q pq p q pq
T T F 1 1 0
T F T 1 0 1
F T T 0 1 1
F F F 0 0 0
Examples (OR vs XOR)
The following proposition uses the (English) connective
“or”. Determine from the context whether “or” is intended
to be used in the inclusive or exclusive sense.

1. “Nabeel has one or two brothers”.


A person cannot have both one and two brothers.
Therefore, “or” is used in the exclusive sense.
Examples (OR vs XOR)

2. To register for BSCS, you must have to pass


the qualifying exam or be listed as an Math
major.

Presumably, if you have passed the qualifying exam and


are also listed as an Math major, you can still register for
BCSC. Therefore, “or” is inclusive.
Composite Statements
Statements and operators can be combined in any
way to form new statements.
(p) (p)
p q p q (q)
p q p q (q)

T T F F F 1 1 0 0 0
T F F T T 1 0 0 1 1

F T T F T 0 1 1 0 1

F F T T T 0 0 1 1 1
Try as much as you can from…

Relevant Exercises given at the end of Section 1.1 of :

Discrete Mathematics and its Applications


(with Combinatorics and Graph Theory)
6th Edition, The McGraw-Hill Companies, 2007,
Kenneth H. Rosen

(Already uploaded on LMS)

You might also like