Scribd
Upload
16 views13 pages

Discrete Structures-Lec01

Uploaded by

mun33bejaz
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
16 views13 pages

Discrete Structures-Lec01

Uploaded by

mun33bejaz
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/ 13

Discrete Structures

Lecture # 1
Discrete Structures
• In this course:

• Mathematical reasoning,
• Logic, propositional and predicate logic,
• rules of inference,
• proof by induction, proof by contraposition, proof by contradiction,
proof by implication,
• set theory, relations, equivalence relations and partitions, partial
orderings,
• recurrence relations, functions, mappings,
• function composition,
• inverse functions, recursive functions, Number Theory
Discrete Structures
• Recommended Books:

• Discrete Mathematics and Its Applications, 7th edition by


Kenneth H. Rosen year 2012

• Recommended Reference Books

• Discrete mathematics with applications, Susanna S. Epp, 5th


Edition, 2019.
• Discrete mathematics, Richard Johnson Baugh, Global
edition, 2018
Discrete Structures

• What is Discrete Structure?


• A set of discrete elements on which certain operations are
defined.

• What is Discrete?
• Non-continuous
• Therefore discrete sets include finite and countable sets
Discrete Structures
• 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
Discrete Structures
• 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
Discrete Structures
• Logic:
• The Statement/Proposition Game
• “Elephants are bigger than mice.”

Is this a statement? Yes

Is this a proposition? Yes

What is the truth value True


of the proposition?
8

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
Discrete Structures
• Logic:

• Simple Statement:
• EXAMPLES:
a. 2+2 = 4,
b. 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.
Discrete Structures
• Logic

• Simple Statement:
• Example:
Propositions Not Propositions

1) Grass is green. 1) Close the door.


2) 4 + 2 = 6 2) x is greater than 2.
3) 4 + 2 = 7 3) He is very rich
Discrete Structures
• Logic:

• Rule:
If the sentence is preceded by other sentences
that make the pronoun or variable reference
clear, then the sentence is a statement.
Example Example
x=1 •Bill Gates is an American.
x>2 •He is very rich
“x > 2” is a statement “He is very rich” is a
with truth-value statement with truth-value
FALSE. TRUE.
Discrete Structures
• Logic:

• UNDERSTANDING STATEMENTS

• 1) x + 2 is positive. Not a statement


2) May I come in? Not a statement
3) Logic is interesting. A statement
4) It is hot today. A statement
5) -1 > 0 A statement
6) x + y = 12 Not a statement
Discrete Structures
• Logic:

• COMPOUND STATEMENT:
Simple statements could be used to build a
compound statement.
LOGICAL CONNECTIVES
EXAMPLES:
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

You might also like