Introduction & Propositional
Logic
Course Code: CSE125
Course Name: Discrete Mathematics
Rishad Amin Pulok
Lecturer, Dept. of CSE
What is Discrete Mathematics?
● Discrete mathematics is the branch of mathematics dealing with objects
that can assume only distinct, separated values. The term "discrete
mathematics" is therefore used in contrast with "continuous
mathematics," which is the branch of mathematics dealing with objects
that can vary smoothly (and which includes, for example, calculus).
Whereas discrete objects can often be characterized by integers,
continuous objects require real numbers.
Discrete Math vs Continuous Math
● Continuous Mathematics − It is based upon continuous number line or the
real numbers. It is characterized by the fact that between any two numbers,
there are almost always an infinite set of numbers. For example, a function in
continuous mathematics can be plotted in a smooth curve without breaks.
Includes Real Numbers, Calculus, Euclidean Geometry etc.
● Discrete Mathematics − It involves distinct values; i.e. between any two points,
there are a countable number of points. For example, if we have a finite set of
objects, the function can be defined as a list of ordered pairs having these
objects, and can be presented as a complete list of those pairs. Includes
Integers, Logical Statements, Graph Theory, probability etc.
Declarative Sentence
Proposition
Examples
Notation
Compound Proposition
Many mathematical statements are constructed by combining one or more
propositions. New propositions, called compound propositions, are formed
from existing propositions using logical operators.
Connectives
Conjunction(AND)
Disjunction(OR)
Negation(Not)
Exclusive Disjunction(Exclusive OR/X-OR)
Implication/Conditional Statement
Bi-conditional Statement/Bi-Implication
Negation
Negation-Truth Table
Conjunction
Disjunction
Exclusive Disjunction
Implication
Implication-Truth Table
Terminologies Used to Express Implication
The implication p → q can be expressed as:
● “if p, then q”;
● “p implies q”;
● “q if p”;
● “p only if q”;
● “q when p”;
● “p is sufficient for q”;
● “A sufficient condition for q is p”;
● “q follows from p”;
● “q whenever p”.
Facts ⇒ Implication
Converse, Inverse & Contrapositive
Bi-Conditional Statement
Bi-Conditional Statement-Truth Table
Precedence of Logical Operators
Operators Precedence
() 1
¬ 2
∧ 3
∨ 4
⊕ 5
⟶ 6
↔ 7
Don’t make the assumption that precedence of logical operators
are well known. Put parentheses instead to make it clear.