Scribd
Upload
21 views

Lecture 1 and 2

This document provides an overview of discrete mathematics and logic. It defines discrete mathematics as the study of mathematical structures that are fundamentally discrete rather than continuous. Logic is defined as the study of valid versus invalid arguments. Simple statements are either true or false, while compound statements combine simple statements using logical connectives like AND and OR. Truth tables specify the truth values of compound statements based on the truth values of their constituent parts. Exercises are provided to test understanding of propositions, negations, conditional statements, and truth tables.

Uploaded by

mehtab Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Lecture 1 and 2

This document provides an overview of discrete mathematics and logic. It defines discrete mathematics as the study of mathematical structures that are fundamentally discrete rather than continuous. Logic is defined as the study of valid versus invalid arguments. Simple statements are either true or false, while compound statements combine simple statements using logical connectives like AND and OR. Truth tables specify the truth values of compound statements based on the truth values of their constituent parts. Exercises are provided to test understanding of propositions, negations, conditional statements, and truth tables.

Uploaded by

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

Discrete Structure

Lecture: 1 & 2

September 13, 2022

Lecture: 1 & 2 Discrete Structure 1/16


Discrete Numbers

(1) Number of students in a class.


The answer is a particular value
(2) Age of students in your class.
In this case the answer is not a particular value.
(3) Today is sunday.
The answer is either yes or no (True or False)

Definition 1
Discrete Mathematics is the study of mathematical structures that
are fundamentally discrete rather than continuous.

Definition 2 (LOGIC)
Logic is the study of the principles and methods that distinguishes
between a valid and an invalid argument

Lecture: 1 & 2 Discrete Structure 2/16


Definition 3 (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.

Example 4
(1) 2+2 = 4,
(2) It is Sunday today.

• If a proposition is true, we say that it has a truth value of ”true”.


• If a proposition is false, its truth value is ”false”.
The truth values “true” and “false” are, respectively, denoted by
the letters T and F.
Example 5 (Proposition)
(1) Grass is green.
(2) 4 + 2 = 6
(3) There are four fingers in a hand
Lecture: 1 & 2 Discrete Structure 3/16
Example 6 (Not Proposition)
(1) Close the door.
(2) x is greater than 2.
(3) He is very rich

• If the sentence is preceded by other sentences that make the


pronoun or variable reference clear, then the sentence is a
statement.
Example 7
(1) x = 1
x >2
Then x > 2 is a statement with truth value False.
(2) Bill Gates is an American
He is very rich
He is very rich is a statement with truth-value TRUE.

Lecture: 1 & 2 Discrete Structure 4/16


LOGICAL CONNECTIVES

COMPOUND STATEMENT
Simple statements could be used to build a compound statement.

Example 8
(1) “3 + 2 = 5” and “Lahore is a city in Pakistan”
(2) “The grass is green” or “ It is hot today”
(3) “Discrete Mathematics is not difficult to me”
AND, OR, NOT are called LOGICAL CONNECTIVES.

SYMBOLIC REPRESENTATION
Statements are symbolically represented by letters such as p, q, r,...

Lecture: 1 & 2 Discrete Structure 5/16


Lecture: 1 & 2 Discrete Structure 6/16
Example 9
p = “Islamabad is the capital of Pakistan”
q = “17 is divisible by 3”
p ∧ q = “Islamabad is the capital of Pakistan and 17 is divisible by
3”
p ∨ q = “Islamabad is the capital of Pakistan or 17 is divisible by
3”
∼p = “It is not the case that Islamabad is the capital of Pakistan”
or simply “Islamabad is not the capital of Pakistan”

Lecture: 1 & 2 Discrete Structure 7/16


Example 10 (TRANSLATING FROM ENGLISH TO SYMBOLS)
Let p = “It is hot”, and q = “ It is sunny”

Sentence SYMBOLIC FORM


It is not hot. ∼p
It is hot and sunny p∧q
It is hot or sunny. p∨q
It is not hot but sunny. ∼p ∧ q
It is neither hot nor sunny. ∼p ∧ ∼ q

Lecture: 1 & 2 Discrete Structure 8/16


Example 11
Let h = “Hamza is healthy”
w = “Hamza is wealthy”
s = “Hamza is wise”

compound statements Symbolic form


Zia is healthy and wealthy but not wise ( h ∧ w)∧ ∼ s
Zia is not wealthy but he is healthy and wise. ∼ w ∧ (h ∧ s)
Zia is neither healthy, wealthy nor wise. ∼h∧∼w∧∼s

Lecture: 1 & 2 Discrete Structure 9/16


Example 12 (Translating from symbols to english)
Let m = “Ali is good in Mathematics”
c = “Ali is a Computer Science student”

Symbolic form statements


∼c Ali is not a Computer Science student
c∨m Ali is a Computer Science student or good in Maths.
m∧∼c Ali is good in Maths but not a Computer Science student

• A convenient method for analyzing a compound statement is to


make a truth table for it.
• A truth table specifies the truth value of a compound proposition
for all possible truth values of its constituent propositions.

Lecture: 1 & 2 Discrete Structure 10/16


Definition 13 (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, ∼p is
false; if p is false, ∼p is true.

p ∼p
T F
F T

Lecture: 1 & 2 Discrete Structure 11/16


Definition 14 (CONJUNCTION ∧)
If p and q are statements, then the conjunction of p and q is “p
and q”, denoted as “p ∧q”. It is true when, and only when, both p
and q are true. If either p or q is false, or if both are false, then
p∧q is false.

p q p∧ q
T T T
T F F
F T F
F F F

Lecture: 1 & 2 Discrete Structure 12/16


Definition 15 (Disjunction ∨)
If p and q are statements, then the disjunction of p and q is “p or
q”, denoted as “p ∨q”. It is true when at least one of p or q is
true and is false only when both p and q are false.

p q p∨ q
T T T
T F T
F T T
F F F

Lecture: 1 & 2 Discrete Structure 13/16


Exercises

Q:1. Which of these sentences are propositions? What are the


truth values of those that are propositions?
(a) Islamabad is the capital of Pakistan.
(b) Miami is the capital of Florida.
(c) 2 + 3 = 5.
(d) 5 + 7 = 10.
(e) x + 2 = 11.
(f) Answer this question.
Q:2. What is the negation of each of these propositions?
(a) Mei has an MP3 player.
(b) There is no pollution in New Jersey.
(c) 2 + 1 = 3.
(d) The summer in Maine is hot and sunny.

Lecture: 1 & 2 Discrete Structure 14/16


Q:3. Determine whether each of these conditional statements is
true or false.
(a) If 1 + 1 = 2, then 2 + 2 = 5.
(b) If 1 + 1 = 3, then 2 + 2 = 4.
(c) If 1 + 1 = 3, then 2 + 2 = 5.
(d) If monkeys can fly, then 1 + 1 = 3.
Q:4. Determine whether each of these conditional statements is
true or false.
(a) If 1 + 1 = 3, then unicorns exist.
(b) If 1 + 1 = 3, then dogs can fly.
(c) If 1 + 1 = 2, then dogs can fly.
(d) If 2 + 2 = 4, then 1 + 2 = 3.

Lecture: 1 & 2 Discrete Structure 15/16


Q:5. Construct a truth table for each of these compound
propositions.
(a) (p ∨ ∼ q)→ q
(b) (p ∨ q)→ (p ∧ q)
(c) (p → q)→ (q → p)
(d) p ⊕(p ∨ q)
(e) (p ∨ q) → (p ⊕ q)
Q:6. Construct a truth table for each of these compound
propositions.

Lecture: 1 & 2 Discrete Structure 16/16

You might also like