Text book

Discrete Mathematics and Its Application, 6th Edition

Kenneth H. Rosen

Dr. Faisal Bukhari, PUCIT 2

 References
Chapter 1
1. Discrete Mathematics and Its Application, 6th Editition
by
Kenneth H. Rose
2. Discrete Mathematics with Applications
by
Thomas Koshy
These slides contain material from the above two books.

Dr. Faisal Bukhari, PUCIT 3

Proposition [1]
• A proposition is a declarative sentence (that is, a sentence that declares a
fact) that is either true or false, but not both.

OR

• It is a statement or sentence which is either true or false but not both.

OR

• A declarative sentence that is either true or false, but not both, is a

proposition (or a statement), which we will denote by lowercase letter p,
q, r, s or t are boolean variables (or logic variables)

Dr. Faisal Bukhari, PUCIT 4

Proposition [2]
EXAMPLE: All the following declarative sentences are propositions.

1. Allama Iqbal was a great poet.

2. Islamabad was a capital city of Pakistan.
3. 1 + 1 = 22
4. 6 > 600
5. 2+2=8
6. Muree is a hill station
7. Islam is a religion of tolerance

Dr. Faisal Bukhari, PUCIT 5

Proposition [3]
EXAMPLE 2 Consider the following sentences.
1 . What time is it?
2 . Read this carefully.
3.x+1=2.
4 . x + y = Z.
5. Let me go!
6. x + 3 = 5
7. Close the door! (command)
8. What is my line? (opinion)

• Sentences 1 and 2 are not propositions because they are not declarative
sentences.
• Sentences 3 and 4 are not propositions because they are neither true nor
false

Dr. Faisal Bukhari, PUCIT 6

Proposition [4]
If a proposition is true, we say that it has a truth value of ``true’’. If it is false,
it has a truth value is ‘’false’’.

Rule: If the sentence is preceded by other sentences that make the pronoun
or variable reference clear then the sentence is a statement.

Example:
x = 1, x > 2
x > 2 is a statement with truth value of false.

Dr. Faisal Bukhari, PUCIT 7

Proposition [5]
Example: George Boole was a famous mathematician. He is renowned.

He is renowned is a statement with truth value true.

Example: Bill Gates is an American. He is very rich.

He is very rich is a statement with truth value true.

Dr. Faisal Bukhari, PUCIT 8

Understanding statements (Quiz)
1. x + 4 is negative
2. May I come in?
3. Logic is interesting
4. It is sunny today
5. -10 > 0
6. x + y = 12
7. Islam is a religion of peace
8. PUCIT is the largest computer science institution in Pakistan
9. 7+7
10. How are you studying discrete mathematics?

Dr. Faisal Bukhari, PUCIT 9

Types of Proposition [1]
There are two types of proposition:

a) Simple proposition

b) Compound proposition

Simple proposition could be used to build a compound statement.

New propositions are formed from existing propositions using logical

operators.

Dr. Faisal Bukhari, PUCIT 10

Types of Proposition [2]
Example:

1. ``Discrete mathematics is a prerequisite of analysis of algorithms’’

and ``Analysis of algorithms is very important subject in computer
science’’.

2. ``1 + 1 = 2’’ and ``2 + 2 = 4’’

3. `` Lahore is a provincial capital of Pakistan” or ‘’Islamabad is a capital

of Pakistan’’

Dr. Faisal Bukhari, PUCIT 11

Logical connectives
• There are four important logical connectives--conjunctions, disjunctions,
conditional statements, and bi-conditional statements as well as
negations.

• We can use these connectives to build up complicated compound

propositions involving any number of propositional variables.

• AND, OR, NOT, if…then (implication or conditionals), if and only if (bi-

implications or bi-conditional) are called logical connectives.

Dr. Faisal Bukhari, PUCIT 12

Connectives
Connective Meanings Symbol Called
Negation not ~ Tilde
Conjunction and ^ Hat
Disjunction or v Vel
Conditional if…then… -> Arrow
(implication)
Bi-conditional if and only if <-> Double arrow
(Bi-implications)

Dr. Faisal Bukhari, PUCIT 13

Propositional Logic – negation [1]
• 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.’’
OR
• The proposition  p is read "not p." The truth value of the negation of p,
 p, is the opposite of the truth value of p.
• OR
Suppose p is a proposition. The negation of p is written p and has
meaning:
“It is not the case that p.”

p Truth table for

p negation
T F
F T

Dr. Faisal Bukhari, PUCIT 14

Propositional Logic – negation[2]
• Example 3: Find the negation of the proposition
"Today is Friday.“

Solution: The negation is

``It is not the case that today is Friday.’’
OR
``Today is not Friday.’’
• Example 4: Find the negation of the proposition
"At least 1 0 inches of rain fell today in Miami.“ and express this in simple
English.
Solution: The negation is
• "It is not the case that at least 10 inches of rain fell today in Miami."
This negation can be more simply expressed by
• "Less than 10 inches of rain fell today in Miami."

Dr. Faisal Bukhari, PUCIT 15

Propositional Logic – negation[3]
• Remark: Strictly speaking, sentences involving variable times such as
those in Examples 3 and 4 are not propositions unless a fixed time is
assumed. The same holds for variable places unless a fixed place is
assumed and for pronouns unless a particular person is assumed. We will
always assume fixed times, fixed places, and particular people in such
sentences unless otherwise noted.

Dr. Faisal Bukhari, PUCIT 16

 Propositional Logic – conjunction [1]
• 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 both p
and q are true and is false otherwise
OR
Let p and q be the two simple propositions. The compound propositions ``
p and q’’ is denoted by p q. It will be true when both are true.
OR
The conjunction of two arbitrary propositions p and q, denoted by p  q, is
the proposition p and q. It is formed by combining the propositions using
the word and, called connective.

Dr. Faisal Bukhari, PUCIT 17

 Propositional Logic – conjunction [2]
• Example: Find the conjunction of the propositions p and q where p is the
proposition "Today is Friday“ and q is the proposition "It is raining today.“

• Solution: The conjunction of these propositions, p  q, is the proposition

"Today is Friday and it is raining today

• The Truth Table for the Conjunction of Two Propositions.

p q pq
T T T
T F F
F T F
F F F

Dr. Faisal Bukhari, PUCIT 18

 Propositional Logic – disjunction [1]
• Let p and q be propositions. The disjunction of p and q, denoted by p v q,
is the proposition "p or q ." The disjunction p v q is false when both p and
q are false and is true otherwise.
OR
Let p and q be the two simple propositions. The compound proposition ``p
or q’’ is denoted by p v q will be true if at least one is true and is false
when both p and q are false.
OR
Way of combining two propositions p and q is by using the connective or.
The resulting proposition p or q is the disjunction of p and q and is
devoted by p v q.

Dr. Faisal Bukhari, PUCIT 19

 Propositional Logic – disjunction [2]
• Example: ``Students who have taken calculus or computer science can take
this class.’’
• The Truth Table for the Disjunction of Two Propositions.

p q pvq
T T T
T F T
F T T
F F F

Dr. Faisal Bukhari, PUCIT 20

Rule
• Note: No of rows in the truth table depend on the number of propositions.
• No of rows = 2n
where n = Number of propositions

Dr. Faisal Bukhari, PUCIT 21

 Suggested Readings
• 1.1 Propositional Logic

Dr. Faisal Bukhari, PUCIT 22